./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh --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 64bit --witnessprinter.graph.data.programhash 728f6e2ff08ff040d7b9a5b3970190759c567c156507e471a97f4901647c0003 --- 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-2329fc7 [2022-12-14 05:49:33,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:49:33,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:49:33,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:49:33,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:49:33,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:49:33,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:49:33,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:49:33,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:49:33,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:49:33,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:49:33,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:49:33,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:49:33,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:49:33,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:49:33,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:49:33,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:49:33,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:49:33,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:49:33,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:49:33,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:49:33,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:49:33,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:49:33,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:49:33,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:49:33,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:49:33,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:49:33,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:49:33,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:49:33,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:49:33,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:49:33,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:49:33,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:49:33,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:49:33,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:49:33,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:49:33,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:49:33,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:49:33,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:49:33,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:49:33,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:49:33,903 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 05:49:33,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:49:33,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:49:33,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:49:33,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:49:33,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:49:33,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:49:33,918 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:49:33,918 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:49:33,918 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:49:33,918 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:49:33,919 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:49:33,919 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:49:33,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:49:33,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:49:33,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:49:33,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:49:33,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:49:33,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:49:33,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:49:33,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:49:33,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:49:33,922 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_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/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_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 728f6e2ff08ff040d7b9a5b3970190759c567c156507e471a97f4901647c0003 [2022-12-14 05:49:34,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:49:34,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:49:34,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:49:34,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:49:34,137 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:49:34,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_11_good.i [2022-12-14 05:49:36,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:49:36,930 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:49:36,931 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_11_good.i [2022-12-14 05:49:36,948 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/data/cfb38f91b/8cd4df348bd04220ab8f3355db542d90/FLAGc180fa150 [2022-12-14 05:49:36,961 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/data/cfb38f91b/8cd4df348bd04220ab8f3355db542d90 [2022-12-14 05:49:36,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:49:36,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:49:36,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:49:36,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:49:36,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:49:36,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:49:36" (1/1) ... [2022-12-14 05:49:36,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e52ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:36, skipping insertion in model container [2022-12-14 05:49:36,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:49:36" (1/1) ... [2022-12-14 05:49:36,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:49:37,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:49:37,296 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:49:37,610 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 05:49:37,614 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:49:37,616 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:49:37,618 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:49:37,618 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:49:37,635 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:49:37,640 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:49:37,647 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 05:49:37,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:49:37,655 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:49:37,677 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:49:37,723 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 05:49:37,725 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:49:37,726 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:49:37,728 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:49:37,728 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:49:37,732 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:49:37,734 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:49:37,737 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 05:49:37,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:49:37,819 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:49:37,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37 WrapperNode [2022-12-14 05:49:37,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:49:37,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:49:37,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:49:37,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:49:37,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,860 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-12-14 05:49:37,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:49:37,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:49:37,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:49:37,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:49:37,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:49:37,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:49:37,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:49:37,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:49:37,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (1/1) ... [2022-12-14 05:49:37,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:49:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:37,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:49:37,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:49:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 05:49:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 05:49:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-12-14 05:49:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:49:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:49:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-12-14 05:49:37,939 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-12-14 05:49:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 05:49:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:49:38,051 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:49:38,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:49:38,241 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:49:38,273 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:49:38,273 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 05:49:38,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:49:38 BoogieIcfgContainer [2022-12-14 05:49:38,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:49:38,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:49:38,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:49:38,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:49:38,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:49:36" (1/3) ... [2022-12-14 05:49:38,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d85a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:49:38, skipping insertion in model container [2022-12-14 05:49:38,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:49:37" (2/3) ... [2022-12-14 05:49:38,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d85a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:49:38, skipping insertion in model container [2022-12-14 05:49:38,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:49:38" (3/3) ... [2022-12-14 05:49:38,284 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_11_good.i [2022-12-14 05:49:38,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:49:38,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 05:49:38,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:49:38,356 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;@7d811887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:49:38,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 05:49:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:49:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:49:38,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:38,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:49:38,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1454760411, now seen corresponding path program 1 times [2022-12-14 05:49:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:38,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42557988] [2022-12-14 05:49:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:38,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42557988] [2022-12-14 05:49:38,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42557988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:38,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:38,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:49:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788840105] [2022-12-14 05:49:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:49:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:49:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:49:38,682 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:49:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:38,755 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-12-14 05:49:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:49:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2022-12-14 05:49:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:38,765 INFO L225 Difference]: With dead ends: 145 [2022-12-14 05:49:38,765 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 05:49:38,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:49:38,772 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:38,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 05:49:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-14 05:49:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 05:49:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-12-14 05:49:38,813 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-12-14 05:49:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:38,814 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-14 05:49:38,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:49:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-12-14 05:49:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:49:38,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:38,816 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] [2022-12-14 05:49:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:49:38,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 588789408, now seen corresponding path program 1 times [2022-12-14 05:49:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288861111] [2022-12-14 05:49:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:38,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:38,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288861111] [2022-12-14 05:49:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288861111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:38,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:38,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:49:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980936529] [2022-12-14 05:49:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:38,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:49:38,890 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:49:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:38,938 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2022-12-14 05:49:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-14 05:49:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:38,940 INFO L225 Difference]: With dead ends: 174 [2022-12-14 05:49:38,941 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 05:49:38,941 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-12-14 05:49:38,942 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:38,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 183 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 05:49:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2022-12-14 05:49:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:49:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2022-12-14 05:49:38,953 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 20 [2022-12-14 05:49:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:38,954 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-12-14 05:49:38,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:49:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2022-12-14 05:49:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:49:38,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:38,954 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-12-14 05:49:38,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:49:38,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1072602544, now seen corresponding path program 1 times [2022-12-14 05:49:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887108134] [2022-12-14 05:49:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:49:39,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:39,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887108134] [2022-12-14 05:49:39,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887108134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:39,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:39,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:49:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141195914] [2022-12-14 05:49:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:39,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:39,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:39,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:49:39,015 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:49:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:39,048 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2022-12-14 05:49:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-12-14 05:49:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:39,050 INFO L225 Difference]: With dead ends: 120 [2022-12-14 05:49:39,050 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 05:49:39,051 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-12-14 05:49:39,052 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:39,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 215 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 05:49:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2022-12-14 05:49:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:49:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-12-14 05:49:39,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-12-14 05:49:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:39,064 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-12-14 05:49:39,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:49:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-12-14 05:49:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 05:49:39,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:39,065 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 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-12-14 05:49:39,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 05:49:39,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1064420024, now seen corresponding path program 1 times [2022-12-14 05:49:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513847285] [2022-12-14 05:49:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:49:39,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:39,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513847285] [2022-12-14 05:49:39,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513847285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:39,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098040262] [2022-12-14 05:49:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:39,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:39,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:39,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:49:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:49:39,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:49:39,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:39,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098040262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:39,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:39,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 05:49:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871610867] [2022-12-14 05:49:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:39,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:39,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:39,289 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 05:49:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:39,319 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-12-14 05:49:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-12-14 05:49:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:39,321 INFO L225 Difference]: With dead ends: 146 [2022-12-14 05:49:39,321 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 05:49:39,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:39,322 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:39,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 05:49:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-12-14 05:49:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:49:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 05:49:39,332 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-12-14 05:49:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:39,332 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 05:49:39,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 05:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 05:49:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:49:39,334 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:39,334 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 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-12-14 05:49:39,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:49:39,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:39,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1061021213, now seen corresponding path program 1 times [2022-12-14 05:49:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126600536] [2022-12-14 05:49:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:49:39,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:39,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126600536] [2022-12-14 05:49:39,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126600536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:39,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:39,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:49:39,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663184593] [2022-12-14 05:49:39,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:39,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:39,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:39,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:49:39,710 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 05:49:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:39,738 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-12-14 05:49:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-12-14 05:49:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:39,740 INFO L225 Difference]: With dead ends: 106 [2022-12-14 05:49:39,740 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 05:49:39,740 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-12-14 05:49:39,741 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 186 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 05:49:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-12-14 05:49:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:49:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 05:49:39,750 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-12-14 05:49:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:39,750 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 05:49:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 05:49:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 05:49:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:49:39,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:39,752 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 05:49:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:49:39,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1468080885, now seen corresponding path program 1 times [2022-12-14 05:49:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433250392] [2022-12-14 05:49:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:49:39,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:39,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433250392] [2022-12-14 05:49:39,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433250392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:39,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:39,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:49:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152485538] [2022-12-14 05:49:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:39,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:39,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:49:39,804 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 05:49:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:39,828 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-12-14 05:49:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-12-14 05:49:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:39,830 INFO L225 Difference]: With dead ends: 105 [2022-12-14 05:49:39,830 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 05:49:39,830 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-12-14 05:49:39,831 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:39,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 05:49:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-12-14 05:49:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:49:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-12-14 05:49:39,839 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-12-14 05:49:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:39,840 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-12-14 05:49:39,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 05:49:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-12-14 05:49:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 05:49:39,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:39,841 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 05:49:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:49:39,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -690215343, now seen corresponding path program 1 times [2022-12-14 05:49:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:39,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567279099] [2022-12-14 05:49:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 05:49:39,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:39,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567279099] [2022-12-14 05:49:39,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567279099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:39,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342543382] [2022-12-14 05:49:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:39,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:39,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:49:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:39,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:49:39,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 05:49:40,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342543382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:40,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:40,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:49:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624861923] [2022-12-14 05:49:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:40,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:40,009 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 05:49:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:40,027 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2022-12-14 05:49:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:40,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-12-14 05:49:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:40,028 INFO L225 Difference]: With dead ends: 79 [2022-12-14 05:49:40,028 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 05:49:40,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:40,029 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:40,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 05:49:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-14 05:49:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:49:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2022-12-14 05:49:40,034 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 42 [2022-12-14 05:49:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:40,034 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2022-12-14 05:49:40,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 05:49:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2022-12-14 05:49:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:49:40,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:40,036 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 05:49:40,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:49:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 05:49:40,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 78161000, now seen corresponding path program 1 times [2022-12-14 05:49:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:40,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568415740] [2022-12-14 05:49:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 05:49:40,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568415740] [2022-12-14 05:49:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568415740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506986051] [2022-12-14 05:49:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:40,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:40,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:49:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:40,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:49:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 05:49:40,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506986051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:40,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:40,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:49:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606313074] [2022-12-14 05:49:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:40,490 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 05:49:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:40,516 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2022-12-14 05:49:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-12-14 05:49:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:40,517 INFO L225 Difference]: With dead ends: 110 [2022-12-14 05:49:40,517 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 05:49:40,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:40,518 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:40,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 05:49:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-12-14 05:49:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 05:49:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-12-14 05:49:40,527 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 43 [2022-12-14 05:49:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:40,527 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-12-14 05:49:40,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 05:49:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-12-14 05:49:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 05:49:40,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:40,529 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 05:49:40,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:49:40,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:40,731 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash 639981950, now seen corresponding path program 1 times [2022-12-14 05:49:40,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:40,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134632269] [2022-12-14 05:49:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:40,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:49:40,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:40,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134632269] [2022-12-14 05:49:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134632269] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287153742] [2022-12-14 05:49:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:40,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:40,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:49:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:40,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:49:40,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 05:49:40,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:40,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287153742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:40,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:40,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 05:49:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442566377] [2022-12-14 05:49:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:40,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:49:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:40,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:49:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:40,985 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:49:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:41,005 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-12-14 05:49:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:49:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-12-14 05:49:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:41,007 INFO L225 Difference]: With dead ends: 111 [2022-12-14 05:49:41,007 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 05:49:41,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:49:41,008 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:41,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 05:49:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-12-14 05:49:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 05:49:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-12-14 05:49:41,014 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 46 [2022-12-14 05:49:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:41,015 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-12-14 05:49:41,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:49:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-12-14 05:49:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 05:49:41,015 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:41,016 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:49:41,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:49:41,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:41,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1371327926, now seen corresponding path program 1 times [2022-12-14 05:49:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:41,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184869447] [2022-12-14 05:49:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:41,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:41,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184869447] [2022-12-14 05:49:41,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184869447] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:41,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408157058] [2022-12-14 05:49:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:41,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:41,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:41,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:49:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:41,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:49:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:49:41,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:41,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408157058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:41,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:41,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:49:41,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239517607] [2022-12-14 05:49:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:41,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:49:41,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:49:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:41,489 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:41,517 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2022-12-14 05:49:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:49:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2022-12-14 05:49:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:41,519 INFO L225 Difference]: With dead ends: 120 [2022-12-14 05:49:41,519 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 05:49:41,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:41,519 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:41,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 05:49:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 05:49:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 61 states have internal predecessors, (69), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 05:49:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 05:49:41,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 52 [2022-12-14 05:49:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:41,524 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 05:49:41,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 05:49:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 05:49:41,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:41,525 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:49:41,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:49:41,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:49:41,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1433554075, now seen corresponding path program 1 times [2022-12-14 05:49:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:41,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901166319] [2022-12-14 05:49:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:41,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901166319] [2022-12-14 05:49:41,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901166319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371294721] [2022-12-14 05:49:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:41,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:41,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:41,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:41,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:49:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:41,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:49:41,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 05:49:41,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:41,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371294721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:41,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:41,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:49:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872738859] [2022-12-14 05:49:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:49:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:49:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:41,873 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:41,900 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-12-14 05:49:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:49:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2022-12-14 05:49:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:41,901 INFO L225 Difference]: With dead ends: 116 [2022-12-14 05:49:41,901 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 05:49:41,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:41,902 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:41,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 05:49:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 05:49:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 61 states have internal predecessors, (67), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 05:49:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2022-12-14 05:49:41,909 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 54 [2022-12-14 05:49:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:41,909 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2022-12-14 05:49:41,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-12-14 05:49:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 05:49:41,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:41,911 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:49:41,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:49:42,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:42,111 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1034683846, now seen corresponding path program 1 times [2022-12-14 05:49:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:42,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811232939] [2022-12-14 05:49:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:42,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:42,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811232939] [2022-12-14 05:49:42,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811232939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:42,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795357565] [2022-12-14 05:49:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:42,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:42,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:49:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:42,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:49:42,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:49:42,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:49:42,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795357565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:42,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:49:42,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:49:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882132505] [2022-12-14 05:49:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:42,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:49:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:49:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:42,280 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:42,308 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2022-12-14 05:49:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:49:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-12-14 05:49:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:42,310 INFO L225 Difference]: With dead ends: 94 [2022-12-14 05:49:42,310 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 05:49:42,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:49:42,311 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:42,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 05:49:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 05:49:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 61 states have internal predecessors, (65), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 05:49:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2022-12-14 05:49:42,315 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 55 [2022-12-14 05:49:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:42,316 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2022-12-14 05:49:42,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:49:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-12-14 05:49:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 05:49:42,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:42,316 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:49:42,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:49:42,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 05:49:42,517 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1352103455, now seen corresponding path program 1 times [2022-12-14 05:49:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:42,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266382462] [2022-12-14 05:49:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:49:42,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:42,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266382462] [2022-12-14 05:49:42,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266382462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:42,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:49:42,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:49:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370397272] [2022-12-14 05:49:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:49:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:49:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:49:42,583 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:49:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:49:42,604 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-12-14 05:49:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:49:42,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 59 [2022-12-14 05:49:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:49:42,605 INFO L225 Difference]: With dead ends: 96 [2022-12-14 05:49:42,606 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 05:49:42,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:49:42,606 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:49:42,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:49:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 05:49:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-14 05:49:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.196078431372549) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:49:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-12-14 05:49:42,612 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 59 [2022-12-14 05:49:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:49:42,613 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-12-14 05:49:42,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:49:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-12-14 05:49:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 05:49:42,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:49:42,614 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:49:42,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 05:49:42,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:49:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:49:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -893102991, now seen corresponding path program 1 times [2022-12-14 05:49:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:49:42,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90792135] [2022-12-14 05:49:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:49:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:42,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:49:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90792135] [2022-12-14 05:49:42,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90792135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:49:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032632877] [2022-12-14 05:49:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:49:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:49:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:49:42,711 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:49:42,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:49:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:49:42,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:49:42,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:49:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:42,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:49:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:49:42,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032632877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:49:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573252847] [2022-12-14 05:49:42,927 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-12-14 05:49:42,927 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:49:42,930 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:49:42,935 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:49:42,936 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:49:43,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:43,380 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:49:43,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:49:43,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:49:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:43,447 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:49:43,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:49:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:43,619 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:49:43,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:49:43,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:49:43,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:43,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:49:44,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:49:44,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,440 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:49:44,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:49:44,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,627 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:49:44,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:49:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:49:44,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:49:44,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:49:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:49:44,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:49:46,638 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:49:46,640 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 05:49:46,670 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:49:46,768 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 05:49:46,775 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:49:54,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1573252847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:49:54,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:49:54,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-12-14 05:49:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544708931] [2022-12-14 05:49:54,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:49:54,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:49:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:49:54,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:49:54,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 05:49:54,197 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 05:50:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:12,683 INFO L93 Difference]: Finished difference Result 308 states and 385 transitions. [2022-12-14 05:50:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 05:50:12,684 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 61 [2022-12-14 05:50:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:12,685 INFO L225 Difference]: With dead ends: 308 [2022-12-14 05:50:12,685 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 05:50:12,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=913, Invalid=5567, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 05:50:12,688 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:12,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 433 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-12-14 05:50:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 05:50:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2022-12-14 05:50:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.105263157894737) internal successors, (84), 82 states have internal predecessors, (84), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-12-14 05:50:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2022-12-14 05:50:12,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 61 [2022-12-14 05:50:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:12,719 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2022-12-14 05:50:12,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 05:50:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2022-12-14 05:50:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 05:50:12,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:12,720 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:50:12,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:50:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:50:12,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:50:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -463330025, now seen corresponding path program 1 times [2022-12-14 05:50:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808538010] [2022-12-14 05:50:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:13,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808538010] [2022-12-14 05:50:13,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808538010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:13,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970352526] [2022-12-14 05:50:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:13,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:13,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:13,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:50:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:13,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:50:13,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:13,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:13,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970352526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [618901529] [2022-12-14 05:50:13,179 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 05:50:13,179 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:13,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:50:13,180 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:50:13,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:50:13,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:13,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:13,449 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:50:13,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:50:13,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:13,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 05:50:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:13,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:50:13,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:13,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:50:14,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:14,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:14,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,065 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:50:14,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:50:14,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:50:14,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:50:14,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,174 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 05:50:14,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-12-14 05:50:14,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:14,381 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 05:50:14,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-12-14 05:50:21,545 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:50:21,546 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 210 for LOIs [2022-12-14 05:50:21,645 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-12-14 05:50:21,647 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 64 for LOIs [2022-12-14 05:50:21,655 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:50:36,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [618901529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:50:36,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:36,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-12-14 05:50:36,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487584606] [2022-12-14 05:50:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:50:36,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:50:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:50:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 05:50:36,394 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:50:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:45,794 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2022-12-14 05:50:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 05:50:45,794 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-12-14 05:50:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:45,795 INFO L225 Difference]: With dead ends: 206 [2022-12-14 05:50:45,795 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 05:50:45,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 143 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 05:50:45,796 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 154 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:45,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 405 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 05:50:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 05:50:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2022-12-14 05:50:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 82 states have internal predecessors, (84), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-14 05:50:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2022-12-14 05:50:45,815 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 65 [2022-12-14 05:50:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:45,816 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2022-12-14 05:50:45,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:50:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2022-12-14 05:50:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 05:50:45,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:45,816 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:50:45,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:50:46,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:50:46,018 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:50:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash 825442563, now seen corresponding path program 1 times [2022-12-14 05:50:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:46,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100350250] [2022-12-14 05:50:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:46,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100350250] [2022-12-14 05:50:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100350250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584118383] [2022-12-14 05:50:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:46,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:46,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:46,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:46,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:50:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:46,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:50:46,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:46,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584118383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:46,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1944391649] [2022-12-14 05:50:46,289 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 05:50:46,289 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:46,290 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:50:46,290 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:50:46,290 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:50:46,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:46,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:46,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:46,440 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:50:46,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:50:46,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:46,548 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:50:46,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:50:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:46,692 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:50:46,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:50:46,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:46,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:50:47,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:47,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:50:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,370 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:50:47,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:50:47,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,526 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:50:47,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:50:47,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,563 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:50:47,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:50:47,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:50:47,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:50:49,179 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:50:49,181 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 05:50:49,199 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:50:49,268 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 05:50:49,349 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:50:59,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1944391649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:50:59,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:59,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-12-14 05:50:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173792240] [2022-12-14 05:50:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:50:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:50:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:50:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:50:59,276 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:51:09,985 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2022-12-14 05:51:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 05:51:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-12-14 05:51:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:51:09,987 INFO L225 Difference]: With dead ends: 222 [2022-12-14 05:51:09,987 INFO L226 Difference]: Without dead ends: 172 [2022-12-14 05:51:09,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=466, Invalid=2840, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 05:51:09,988 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 201 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:51:09,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 527 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-14 05:51:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-14 05:51:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2022-12-14 05:51:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.0761904761904761) internal successors, (113), 111 states have internal predecessors, (113), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 05:51:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2022-12-14 05:51:10,018 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 65 [2022-12-14 05:51:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:51:10,018 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2022-12-14 05:51:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2022-12-14 05:51:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:51:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:51:10,019 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:51:10,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 05:51:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:10,220 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:51:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:51:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1968833010, now seen corresponding path program 1 times [2022-12-14 05:51:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:51:10,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590116362] [2022-12-14 05:51:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:51:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:10,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:51:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590116362] [2022-12-14 05:51:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590116362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:51:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651926365] [2022-12-14 05:51:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:51:10,321 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:51:10,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:51:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:51:10,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:51:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:10,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:51:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:10,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651926365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:51:10,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2024195960] [2022-12-14 05:51:10,481 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 05:51:10,481 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:51:10,481 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:51:10,481 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:51:10,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:51:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:10,743 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:51:10,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:51:10,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:10,889 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:51:10,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:51:10,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:10,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:10,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:51:10,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:10,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:10,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:51:11,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,417 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:51:11,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:51:11,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,612 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:51:11,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:51:11,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:51:11,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:51:11,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:11,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:11,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:51:13,685 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:51:13,687 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-12-14 05:51:13,781 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:51:13,863 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 05:51:13,870 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:51:24,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2024195960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:51:24,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:51:24,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 05:51:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199218546] [2022-12-14 05:51:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:51:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:51:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:51:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:51:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 05:51:24,419 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:51:33,982 INFO L93 Difference]: Finished difference Result 200 states and 232 transitions. [2022-12-14 05:51:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 05:51:33,983 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-12-14 05:51:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:51:33,984 INFO L225 Difference]: With dead ends: 200 [2022-12-14 05:51:33,984 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 05:51:33,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 05:51:33,985 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:51:33,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 254 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 05:51:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 05:51:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-14 05:51:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.077922077922078) internal successors, (83), 82 states have internal predecessors, (83), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 05:51:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2022-12-14 05:51:34,009 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 67 [2022-12-14 05:51:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:51:34,010 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2022-12-14 05:51:34,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2022-12-14 05:51:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:51:34,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:51:34,011 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:51:34,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 05:51:34,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:51:34,212 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:51:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:51:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash -975604230, now seen corresponding path program 1 times [2022-12-14 05:51:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:51:34,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075583960] [2022-12-14 05:51:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:51:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:34,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:51:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075583960] [2022-12-14 05:51:34,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075583960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:51:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137780760] [2022-12-14 05:51:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:34,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:34,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:51:34,315 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:51:34,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:51:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:34,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:51:34,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:51:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:34,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:51:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:51:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137780760] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:51:34,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571727909] [2022-12-14 05:51:34,474 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 05:51:34,474 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:51:34,475 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:51:34,475 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:51:34,475 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:51:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:34,622 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:51:34,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:51:34,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:34,760 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:51:34,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:51:34,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:34,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 05:51:34,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:34,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:34,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:34,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:51:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,548 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:51:35,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:51:35,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,594 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:51:35,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:51:35,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,685 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-12-14 05:51:35,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 85 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 12 case distinctions, treesize of input 77 treesize of output 137 [2022-12-14 05:51:35,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:35,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:35,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:35,845 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 05:51:35,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 161 treesize of output 209 [2022-12-14 05:51:36,496 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:51:36,497 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-12-14 05:51:36,553 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-12-14 05:51:36,598 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 05:51:36,605 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:51:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1571727909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:51:43,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:51:43,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 05:51:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825375827] [2022-12-14 05:51:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:51:43,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:51:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:51:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:51:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1669, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 05:51:43,018 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:51:53,133 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2022-12-14 05:51:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 05:51:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-12-14 05:51:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:51:53,134 INFO L225 Difference]: With dead ends: 169 [2022-12-14 05:51:53,135 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 05:51:53,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 153 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=605, Invalid=3555, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 05:51:53,136 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:51:53,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 564 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 05:51:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 05:51:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2022-12-14 05:51:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 05:51:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-12-14 05:51:53,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 67 [2022-12-14 05:51:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:51:53,159 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-12-14 05:51:53,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 05:51:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-12-14 05:51:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 05:51:53,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:51:53,159 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 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] [2022-12-14 05:51:53,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:51:53,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 05:51:53,362 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:51:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:51:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1770289321, now seen corresponding path program 1 times [2022-12-14 05:51:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:51:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988242641] [2022-12-14 05:51:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:51:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:51:53,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:51:53,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988242641] [2022-12-14 05:51:53,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988242641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:51:53,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550468887] [2022-12-14 05:51:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:51:53,425 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:51:53,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:51:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:53,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:51:53,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:51:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:51:53,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:51:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:51:53,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550468887] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:51:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1603626311] [2022-12-14 05:51:53,578 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 05:51:53,578 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:51:53,579 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:51:53,579 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:51:53,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:51:53,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:53,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:53,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:53,808 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:51:53,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:51:53,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:53,844 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:51:53,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:51:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:53,986 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:51:53,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:51:54,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:51:54,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:54,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:51:54,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,605 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:51:54,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:51:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,725 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:51:54,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:51:54,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:51:54,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:51:54,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:51:54,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:51:56,488 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:51:56,489 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 05:51:56,511 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:51:56,587 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 05:51:56,589 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:52:04,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1603626311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:04,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:52:04,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 05:52:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284379476] [2022-12-14 05:52:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:04,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:52:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:52:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 05:52:04,862 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:52:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:08,275 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-12-14 05:52:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 05:52:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-12-14 05:52:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:08,276 INFO L225 Difference]: With dead ends: 141 [2022-12-14 05:52:08,277 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 05:52:08,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 05:52:08,277 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:08,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 187 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-14 05:52:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 05:52:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2022-12-14 05:52:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 74 states have internal predecessors, (74), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 05:52:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2022-12-14 05:52:08,316 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 69 [2022-12-14 05:52:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:08,316 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2022-12-14 05:52:08,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:52:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-12-14 05:52:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 05:52:08,317 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:08,317 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:52:08,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 05:52:08,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:08,519 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:52:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1350677792, now seen corresponding path program 1 times [2022-12-14 05:52:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:08,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681906760] [2022-12-14 05:52:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:08,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:08,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681906760] [2022-12-14 05:52:08,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681906760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:08,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021084295] [2022-12-14 05:52:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:08,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:08,621 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:08,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:52:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:08,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:52:08,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:08,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:52:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:08,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021084295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:52:08,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1655991217] [2022-12-14 05:52:08,768 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-12-14 05:52:08,768 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:52:08,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:52:08,768 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:52:08,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:52:08,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,005 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:52:09,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:52:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 05:52:09,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:09,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:52:09,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:09,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:52:09,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:09,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:09,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,687 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:52:09,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:52:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,728 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:52:09,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:52:09,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,821 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 05:52:09,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-12-14 05:52:09,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:09,995 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 05:52:09,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 205 [2022-12-14 05:52:20,122 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:52:20,123 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 05:52:20,124 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-12-14 05:52:20,125 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 05:52:20,212 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:52:38,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1655991217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:38,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:52:38,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-12-14 05:52:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050485041] [2022-12-14 05:52:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:38,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:52:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:52:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:52:38,920 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:52:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:40,887 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-12-14 05:52:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:52:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-12-14 05:52:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:40,888 INFO L225 Difference]: With dead ends: 114 [2022-12-14 05:52:40,888 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 05:52:40,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 159 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:52:40,890 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:40,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 148 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 05:52:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 05:52:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-14 05:52:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 05:52:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-12-14 05:52:40,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 71 [2022-12-14 05:52:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:40,907 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-12-14 05:52:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:52:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-12-14 05:52:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 05:52:40,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:40,908 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 05:52:40,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:52:41,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:41,110 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:52:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:41,111 INFO L85 PathProgramCache]: Analyzing trace with hash 629758496, now seen corresponding path program 1 times [2022-12-14 05:52:41,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:41,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121205326] [2022-12-14 05:52:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:41,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:41,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121205326] [2022-12-14 05:52:41,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121205326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:41,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553078] [2022-12-14 05:52:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:41,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:41,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:41,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:41,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:52:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:41,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:52:41,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:41,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:52:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:52:41,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:52:41,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1026161703] [2022-12-14 05:52:41,336 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-12-14 05:52:41,337 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:52:41,337 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:52:41,337 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:52:41,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:52:41,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:41,554 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:52:41,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:52:41,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:41,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 05:52:41,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:41,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:41,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:41,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:52:41,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:41,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:52:42,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:42,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:52:42,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,292 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:52:42,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:52:42,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,436 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:52:42,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:52:42,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:52:42,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:52:42,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:42,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:52:44,548 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:52:44,549 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 215 for LOIs [2022-12-14 05:52:44,639 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:52:44,729 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 05:52:44,811 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:52:57,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1026161703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:52:57,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:52:57,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-12-14 05:52:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703559734] [2022-12-14 05:52:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:52:57,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 05:52:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 05:52:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 05:52:57,142 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:53:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:53:00,572 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-12-14 05:53:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 05:53:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-12-14 05:53:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:53:00,573 INFO L225 Difference]: With dead ends: 95 [2022-12-14 05:53:00,573 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 05:53:00,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 05:53:00,574 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:53:00,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 119 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 05:53:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 05:53:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 05:53:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:53:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-12-14 05:53:00,590 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 71 [2022-12-14 05:53:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:53:00,590 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-12-14 05:53:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:53:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-12-14 05:53:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 05:53:00,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:53:00,591 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 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] [2022-12-14 05:53:00,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 05:53:00,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 05:53:00,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:53:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:53:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash 517215447, now seen corresponding path program 1 times [2022-12-14 05:53:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:53:00,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160262280] [2022-12-14 05:53:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:53:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:53:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:53:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:53:00,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:53:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160262280] [2022-12-14 05:53:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160262280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:53:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445106245] [2022-12-14 05:53:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:53:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:53:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:53:00,880 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:53:00,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 05:53:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:53:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:53:00,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:53:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:53:00,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:53:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:53:01,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445106245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:53:01,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1605614330] [2022-12-14 05:53:01,038 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-12-14 05:53:01,038 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:53:01,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:53:01,039 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:53:01,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:53:01,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:53:01,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:01,174 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:53:01,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:53:01,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:53:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:01,290 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:53:01,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:53:01,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:01,438 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:53:01,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:53:01,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:01,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:53:02,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,175 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:53:02,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:53:02,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,317 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:53:02,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:53:02,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:53:02,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:53:02,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:53:02,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:53:02,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:53:02,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:53:04,549 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 05:53:04,550 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 05:53:04,551 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 05:53:04,628 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 05:53:04,635 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:53:15,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1605614330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:53:15,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:53:15,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-12-14 05:53:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537666178] [2022-12-14 05:53:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:53:15,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 05:53:15,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:53:15,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 05:53:15,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 05:53:15,869 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:53:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:53:17,735 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-12-14 05:53:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 05:53:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 73 [2022-12-14 05:53:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:53:17,736 INFO L225 Difference]: With dead ends: 68 [2022-12-14 05:53:17,736 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 05:53:17,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 170 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=339, Invalid=1823, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 05:53:17,737 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:53:17,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:53:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 05:53:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 05:53:17,738 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-12-14 05:53:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 05:53:17,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-12-14 05:53:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:53:17,738 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 05:53:17,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:53:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 05:53:17,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 05:53:17,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 05:53:17,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 05:53:17,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 05:53:17,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 05:53:53,556 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 05:53:53,556 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 05:53:53,556 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1514 1517) the Hoare annotation is: true [2022-12-14 05:53:53,556 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1583) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point L1572-1(lines 1548 1585) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 05:53:53,557 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 05:53:53,558 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|) 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,558 INFO L899 garLoopResultBuilder]: For program point L1606(lines 1606 1617) no Hoare annotation was computed. [2022-12-14 05:53:53,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 05:53:53,558 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (let ((.cse47 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse47 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8))))) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) .cse47) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 .cse38) .cse5 .cse6 .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) [2022-12-14 05:53:53,558 INFO L899 garLoopResultBuilder]: For program point L1590-1(line 1590) no Hoare annotation was computed. [2022-12-14 05:53:53,558 INFO L899 garLoopResultBuilder]: For program point L1590-2(lines 1590 1603) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L895 garLoopResultBuilder]: At program point L1590-4(lines 1590 1603) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse37 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= 51 (select |#length| 5))) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse37 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse13) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse37) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-12-14 05:53:53,559 INFO L895 garLoopResultBuilder]: At program point L1615(line 1615) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (<= (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|) 0)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse13) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse38) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point L1574(lines 1574 1582) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point L1632(line 1632) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point L1632-1(lines 1632 1639) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-14 05:53:53,559 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1584) no Hoare annotation was computed. [2022-12-14 05:53:53,560 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (let ((.cse64 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse65 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse52 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (<= .cse65 0)) (.cse56 (< 0 .cse65)) (.cse61 (<= .cse64 0)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse51 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse60 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (< 0 .cse64)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= 51 (select |#length| 5))) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse55 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse43 (= ~globalArgc~0 0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse52) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse52) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse42 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse52) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse40 .cse41 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse43 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse58 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse42 .cse43 .cse63 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)))) [2022-12-14 05:53:53,560 INFO L899 garLoopResultBuilder]: For program point L1624-1(line 1624) no Hoare annotation was computed. [2022-12-14 05:53:53,560 INFO L899 garLoopResultBuilder]: For program point L1624-2(lines 1624 1631) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L895 garLoopResultBuilder]: At program point L1624-3(lines 1624 1631) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse65 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse64 (store ((as const (Array Int Int)) 0) 0 0)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|))) (let ((.cse53 (< 0 .cse66)) (.cse54 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse64) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10))))) (.cse22 (<= .cse65 0)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse57 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse48 (<= 0 .cse65)) (.cse61 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse64 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse63 (<= .cse67 0)) (.cse60 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse52 (< 0 .cse67)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (<= .cse66 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse56 (= .cse65 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= 51 (select |#length| 5))) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse64 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse57 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse62 .cse63 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse57 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse64) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse58 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51)))) [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1649-1(lines 1649 1656) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 1657) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1608(lines 1608 1616) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse50 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= 51 (select |#length| 8))) (.cse11 (= (select |#valid| 11) 1)) (.cse12 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse13 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse17 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse18 (= (select |#valid| 3) 1)) (.cse19 (= 21 (select |#length| 4))) (.cse20 (= (select |#valid| 7) 1)) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= (select |#length| 10) 18)) (.cse24 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse50 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 .cse50) .cse6 .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1600-1(lines 1594 1601) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1638) no Hoare annotation was computed. [2022-12-14 05:53:53,561 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-12-14 05:53:53,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-12-14 05:53:53,562 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-12-14 05:53:53,562 INFO L899 garLoopResultBuilder]: For program point L1651(lines 1651 1655) no Hoare annotation was computed. [2022-12-14 05:53:53,562 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,562 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-12-14 05:53:53,562 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-12-14 05:53:53,562 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,562 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-12-14 05:53:53,562 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point L1610-1(line 1610) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L895 garLoopResultBuilder]: At program point L1668(line 1668) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point L1668-1(line 1668) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1601) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point L1586(lines 1586 1619) no Hoare annotation was computed. [2022-12-14 05:53:53,563 INFO L895 garLoopResultBuilder]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse39 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823))) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= 51 (select |#length| 5))) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse39 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (< 0 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) .cse32 .cse33 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse39) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse41 .cse42 .cse43 .cse44 .cse45 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse46 .cse47 .cse48))) [2022-12-14 05:53:53,563 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point L1636-1(line 1636) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point L1620(lines 1620 1640) no Hoare annotation was computed. [2022-12-14 05:53:53,564 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-12-14 05:53:53,565 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse22 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse55 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse22) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse56 (<= 0 .cse52)) (.cse53 (<= .cse68 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse66 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse22 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse60 (< 0 .cse67)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse65 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse57 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse22 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse61 (< 0 .cse68)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse36 (= .cse52 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse59 (<= .cse67 0)) (.cse64 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse44 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse22) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse52 0) .cse23 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse54 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse58 .cse59 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse64 .cse44 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse65 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse22) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 05:53:53,565 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-12-14 05:53:53,565 INFO L895 garLoopResultBuilder]: At program point L1645-4(lines 1645 1648) the Hoare annotation is: (let ((.cse66 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse52 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse23 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse57 (< 0 .cse67)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse55 (<= .cse68 0)) (.cse58 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse65 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse23 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse61 (< 0 .cse68)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse66 0)) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse64 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse53 (<= .cse67 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse44 (= ~globalArgc~0 0)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse23) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse60 (<= 0 .cse66)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse23) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse54 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse58 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse58 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse23) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= .cse66 0) .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse56 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51)))) [2022-12-14 05:53:53,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-14 05:53:53,565 INFO L902 garLoopResultBuilder]: At program point L1670(line 1670) the Hoare annotation is: true [2022-12-14 05:53:53,566 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: (let ((.cse54 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse61 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse62 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse61 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse64 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse65 (<= .cse67 0)) (.cse53 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse31 (< 0 .cse66)) (.cse57 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse61) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse60 (<= 0 .cse54)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (< 0 .cse67)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse56 (<= .cse66 0)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse54 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse43 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse44 (= ~globalArgc~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse61 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse54 0) .cse55 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse44 .cse58 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse61) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse61) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse64 .cse65 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-12-14 05:53:53,566 INFO L902 garLoopResultBuilder]: At program point L1670-1(line 1670) the Hoare annotation is: true [2022-12-14 05:53:53,566 INFO L899 garLoopResultBuilder]: For program point L1604(line 1604) no Hoare annotation was computed. [2022-12-14 05:53:53,566 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1604 1618) no Hoare annotation was computed. [2022-12-14 05:53:53,566 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1510 1513) the Hoare annotation is: true [2022-12-14 05:53:53,566 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-12-14 05:53:53,569 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:53:53,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 05:53:53,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:53:53 BoogieIcfgContainer [2022-12-14 05:53:53,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 05:53:53,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 05:53:53,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 05:53:53,579 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 05:53:53,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:49:38" (3/4) ... [2022-12-14 05:53:53,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 05:53:53,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 05:53:53,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-12-14 05:53:53,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 05:53:53,587 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-12-14 05:53:53,591 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 05:53:53,592 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 05:53:53,592 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 05:53:53,592 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:53:53,592 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:53:53,632 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 05:53:53,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 05:53:53,633 INFO L158 Benchmark]: Toolchain (without parser) took 256668.21ms. Allocated memory was 119.5MB in the beginning and 293.6MB in the end (delta: 174.1MB). Free memory was 74.8MB in the beginning and 53.3MB in the end (delta: 21.4MB). Peak memory consumption was 197.2MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,633 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:53:53,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.23ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 95.1MB in the end (delta: -20.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.09ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,634 INFO L158 Benchmark]: Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,634 INFO L158 Benchmark]: RCFGBuilder took 391.19ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 126.6MB in the end (delta: -36.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,634 INFO L158 Benchmark]: TraceAbstraction took 255300.58ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 126.6MB in the beginning and 58.6MB in the end (delta: 67.9MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,634 INFO L158 Benchmark]: Witness Printer took 53.69ms. Allocated memory is still 293.6MB. Free memory was 58.6MB in the beginning and 53.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 05:53:53,635 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.13ms. Allocated memory is still 119.5MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.23ms. Allocated memory was 119.5MB in the beginning and 167.8MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 95.1MB in the end (delta: -20.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.09ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 92.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.19ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 126.6MB in the end (delta: -36.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 255300.58ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 126.6MB in the beginning and 58.6MB in the end (delta: 67.9MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. * Witness Printer took 53.69ms. Allocated memory is still 293.6MB. Free memory was 58.6MB in the beginning and 53.3MB in the end (delta: 5.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: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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 5 procedures, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 255.2s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1397 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 5354 SdHoareTripleChecker+Invalid, 27.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3684 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16081 IncrementalHoareTripleChecker+Invalid, 16587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 1670 mSDtfsCounter, 16081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2329 GetRequests, 1731 SyntacticMatches, 69 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8358 ImplicationChecksByTransitivity, 138.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=16, InterpolantAutomatonStates: 474, 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, 22 MinimizatonAttempts, 299 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 210 PreInvPairs, 321 NumberOfFragments, 18449 HoareAnnotationTreeSize, 210 FomulaSimplifications, 4242 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 25 FomulaSimplificationsInter, 84371 FormulaSimplificationTreeSizeReductionInter, 32.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2053 NumberOfCodeBlocks, 2053 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 3540 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4212 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 47 InterpolantComputations, 13 PerfectInterpolantSequences, 1243/1286 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: 42.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 45, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 543, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 375, TOOLS_POST_TIME: 17.8s, TOOLS_POST_CALL_APPLICATIONS: 306, TOOLS_POST_CALL_TIME: 12.8s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 7.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 885, TOOLS_QUANTIFIERELIM_TIME: 37.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1284, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 270, DOMAIN_JOIN_TIME: 3.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 543, DOMAIN_ISBOTTOM_TIME: 1.2s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 204, CALL_SUMMARIZER_CACHE_MISSES: 36, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 17634, DAG_COMPRESSION_RETAINED_NODES: 1311, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1670]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 05:53:53,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9f7203-743a-45a0-9184-e821ff96cf99/bin/utaipan-gh47qXpMRh/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