./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/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_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/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_f7edf816-4120-4679-a777-6747fce5d125/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 2977efd2d5ad4d675080b4eb7ad25e4e139daa92bd76e63bdcb184ae91de9ac9 --- 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 15:05:19,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:05:19,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:05:19,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:05:19,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:05:19,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:05:19,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:05:19,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:05:19,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:05:19,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:05:19,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:05:19,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:05:19,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:05:19,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:05:19,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:05:19,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:05:19,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:05:19,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:05:19,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:05:19,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:05:19,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:05:19,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:05:19,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:05:19,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:05:19,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:05:19,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:05:19,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:05:19,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:05:19,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:05:19,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:05:19,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:05:19,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:05:19,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:05:19,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:05:19,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:05:19,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:05:19,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:05:19,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:05:19,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:05:19,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:05:19,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:05:19,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 15:05:19,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:05:19,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:05:19,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:05:19,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:05:19,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:05:19,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:05:19,908 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:05:19,908 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:05:19,909 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:05:19,909 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:05:19,909 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:05:19,909 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:05:19,909 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:05:19,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:05:19,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:05:19,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:05:19,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:05:19,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:05:19,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:05:19,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:05:19,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:05:19,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:05:19,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:05:19,912 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_f7edf816-4120-4679-a777-6747fce5d125/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_f7edf816-4120-4679-a777-6747fce5d125/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 -> 2977efd2d5ad4d675080b4eb7ad25e4e139daa92bd76e63bdcb184ae91de9ac9 [2022-12-14 15:05:20,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:05:20,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:05:20,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:05:20,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:05:20,096 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:05:20,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_08_good.i [2022-12-14 15:05:22,770 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:05:23,054 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:05:23,055 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_08_good.i [2022-12-14 15:05:23,073 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/data/96b7b3e81/571c35fb9933451c99c9f9a0b6e22550/FLAGe20b8745f [2022-12-14 15:05:23,086 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/data/96b7b3e81/571c35fb9933451c99c9f9a0b6e22550 [2022-12-14 15:05:23,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:05:23,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:05:23,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:05:23,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:05:23,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:05:23,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ecfe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23, skipping insertion in model container [2022-12-14 15:05:23,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:05:23,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:05:23,354 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:05:23,640 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 15:05:23,644 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:05:23,646 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:05:23,648 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:05:23,648 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:05:23,677 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 15:05:23,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:05:23,685 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:05:23,698 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:05:23,728 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 15:05:23,730 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:05:23,730 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:05:23,732 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:05:23,732 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:05:23,740 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 15:05:23,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:05:23,839 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:05:23,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23 WrapperNode [2022-12-14 15:05:23,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:05:23,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:05:23,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:05:23,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:05:23,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,882 INFO L138 Inliner]: procedures = 505, calls = 77, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-12-14 15:05:23,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:05:23,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:05:23,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:05:23,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:05:23,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:05:23,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:05:23,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:05:23,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:05:23,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (1/1) ... [2022-12-14 15:05:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:05:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:23,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:05:23,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:05:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 15:05:23,963 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 15:05:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 15:05:23,963 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 15:05:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:05:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:05:23,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:05:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-12-14 15:05:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-12-14 15:05:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-12-14 15:05:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-12-14 15:05:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 15:05:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:05:24,078 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:05:24,080 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:05:24,284 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:05:24,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:05:24,395 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 15:05:24,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:05:24 BoogieIcfgContainer [2022-12-14 15:05:24,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:05:24,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:05:24,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:05:24,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:05:24,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:05:23" (1/3) ... [2022-12-14 15:05:24,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b1542a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:05:24, skipping insertion in model container [2022-12-14 15:05:24,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:05:23" (2/3) ... [2022-12-14 15:05:24,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b1542a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:05:24, skipping insertion in model container [2022-12-14 15:05:24,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:05:24" (3/3) ... [2022-12-14 15:05:24,407 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_08_good.i [2022-12-14 15:05:24,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:05:24,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 15:05:24,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:05:24,473 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;@6bb3018f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:05:24,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 15:05:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 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 15:05:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:05:24,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:24,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:05:24,483 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 15:05:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash 902927096, now seen corresponding path program 1 times [2022-12-14 15:05:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:24,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38530487] [2022-12-14 15:05:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:24,734 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 15:05:24,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:24,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38530487] [2022-12-14 15:05:24,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38530487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:24,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:05:24,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:05:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480531633] [2022-12-14 15:05:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:24,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:05:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:05:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:05:24,772 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 15:05:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:24,843 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2022-12-14 15:05:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:05:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2022-12-14 15:05:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:24,854 INFO L225 Difference]: With dead ends: 106 [2022-12-14 15:05:24,854 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 15:05:24,857 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 15:05:24,860 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:24,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 15:05:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2022-12-14 15:05:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.375) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:05:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-12-14 15:05:24,897 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 16 [2022-12-14 15:05:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:24,898 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-12-14 15:05:24,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 15:05:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-12-14 15:05:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:05:24,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:24,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:05:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:05:24,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2074031020, now seen corresponding path program 1 times [2022-12-14 15:05:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692928500] [2022-12-14 15:05:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,115 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 15:05:25,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692928500] [2022-12-14 15:05:25,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692928500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:25,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:05:25,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:05:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908681110] [2022-12-14 15:05:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:25,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:05:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:25,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:05:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:05:25,119 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 15:05:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:25,177 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-12-14 15:05:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:05:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-12-14 15:05:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:25,178 INFO L225 Difference]: With dead ends: 59 [2022-12-14 15:05:25,178 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 15:05:25,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:05:25,179 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:25,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 15:05:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-14 15:05:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.34375) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:05:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-12-14 15:05:25,186 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 17 [2022-12-14 15:05:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:25,186 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-12-14 15:05:25,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 15:05:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-12-14 15:05:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 15:05:25,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:25,187 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 15:05:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:05:25,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2055722937, now seen corresponding path program 1 times [2022-12-14 15:05:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:25,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274042951] [2022-12-14 15:05:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:05:25,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:25,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274042951] [2022-12-14 15:05:25,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274042951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:25,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:05:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:05:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61440054] [2022-12-14 15:05:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:05:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:05:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:05:25,258 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 15:05:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:25,298 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-12-14 15:05:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:05:25,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2022-12-14 15:05:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:25,300 INFO L225 Difference]: With dead ends: 102 [2022-12-14 15:05:25,300 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 15:05:25,300 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 15:05:25,302 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:25,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 15:05:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-14 15:05:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-12-14 15:05:25,307 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 29 [2022-12-14 15:05:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:25,308 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-12-14 15:05:25,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 15:05:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-12-14 15:05:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:05:25,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:25,309 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 15:05:25,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:05:25,309 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 15:05:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1633940887, now seen corresponding path program 1 times [2022-12-14 15:05:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:25,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921106669] [2022-12-14 15:05:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:05:25,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:25,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921106669] [2022-12-14 15:05:25,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921106669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:25,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:05:25,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:05:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74335996] [2022-12-14 15:05:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:25,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:05:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:05:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:05:25,354 INFO L87 Difference]: Start difference. First operand 57 states and 72 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 15:05:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:25,388 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-12-14 15:05:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:05:25,388 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 30 [2022-12-14 15:05:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:25,389 INFO L225 Difference]: With dead ends: 80 [2022-12-14 15:05:25,389 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 15:05:25,390 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 15:05:25,391 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 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 15:05:25,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 15:05:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-12-14 15:05:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-12-14 15:05:25,400 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2022-12-14 15:05:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:25,400 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-12-14 15:05:25,401 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 15:05:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-12-14 15:05:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:05:25,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:25,402 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 15:05:25,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:05:25,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 887440164, now seen corresponding path program 1 times [2022-12-14 15:05:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:25,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439213442] [2022-12-14 15:05:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:05:25,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439213442] [2022-12-14 15:05:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439213442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:25,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:05:25,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:05:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183972689] [2022-12-14 15:05:25,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:05:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:05:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:05:25,557 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 15:05:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:25,605 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-12-14 15:05:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:05:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-12-14 15:05:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:25,607 INFO L225 Difference]: With dead ends: 56 [2022-12-14 15:05:25,607 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 15:05:25,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:05:25,608 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:25,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 15:05:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 15:05:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 40 states have internal predecessors, (40), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-12-14 15:05:25,616 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 31 [2022-12-14 15:05:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:25,616 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-12-14 15:05:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 15:05:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-12-14 15:05:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 15:05:25,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:25,617 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] [2022-12-14 15:05:25,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:05:25,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1075359679, now seen corresponding path program 1 times [2022-12-14 15:05:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:25,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508289997] [2022-12-14 15:05:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 15:05:25,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508289997] [2022-12-14 15:05:25,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508289997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606421565] [2022-12-14 15:05:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:25,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:25,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:25,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:05:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:25,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:05:25,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:25,838 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 15:05:25,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:05:25,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606421565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:25,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:05:25,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:05:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487937561] [2022-12-14 15:05:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:25,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:05:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:05:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:05:25,840 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 15:05:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:25,867 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-12-14 15:05:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:05:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 40 [2022-12-14 15:05:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:25,868 INFO L225 Difference]: With dead ends: 55 [2022-12-14 15:05:25,868 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 15:05:25,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 15:05:25,868 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:25,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 15:05:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-14 15:05:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 39 states have internal predecessors, (39), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-12-14 15:05:25,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 40 [2022-12-14 15:05:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:25,874 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-12-14 15:05:25,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 15:05:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-12-14 15:05:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:05:25,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:25,875 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] [2022-12-14 15:05:25,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:05:26,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:26,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1023588183, now seen corresponding path program 1 times [2022-12-14 15:05:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576683588] [2022-12-14 15:05:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 15:05:26,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:26,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576683588] [2022-12-14 15:05:26,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576683588] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:26,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724412676] [2022-12-14 15:05:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:26,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:26,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:05:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:26,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:05:26,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:26,267 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 15:05:26,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:05:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724412676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:26,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:05:26,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:05:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744365229] [2022-12-14 15:05:26,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:05:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:05:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:05:26,270 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:05:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:26,297 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-12-14 15:05:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:05:26,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 41 [2022-12-14 15:05:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:26,298 INFO L225 Difference]: With dead ends: 71 [2022-12-14 15:05:26,298 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 15:05:26,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 15:05:26,300 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:26,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 15:05:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-12-14 15:05:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 15:05:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-12-14 15:05:26,309 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 41 [2022-12-14 15:05:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:26,309 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-12-14 15:05:26,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 15:05:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-12-14 15:05:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 15:05:26,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:26,310 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 15:05:26,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:05:26,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:26,511 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 15:05:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash -925097529, now seen corresponding path program 1 times [2022-12-14 15:05:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:26,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937030558] [2022-12-14 15:05:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 15:05:26,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:26,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937030558] [2022-12-14 15:05:26,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937030558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:26,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130120980] [2022-12-14 15:05:26,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:26,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:26,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:26,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:26,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:05:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:26,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:05:26,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 15:05:26,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:05:26,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130120980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:26,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:05:26,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:05:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62822209] [2022-12-14 15:05:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:26,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:05:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:05:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:05:26,696 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 15:05:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:26,719 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-12-14 15:05:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:05:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 44 [2022-12-14 15:05:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:26,721 INFO L225 Difference]: With dead ends: 59 [2022-12-14 15:05:26,721 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 15:05:26,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 15:05:26,722 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:26,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 15:05:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-12-14 15:05:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 38 states have internal predecessors, (38), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-12-14 15:05:26,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 44 [2022-12-14 15:05:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:26,731 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-12-14 15:05:26,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 15:05:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-12-14 15:05:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 15:05:26,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:26,732 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] [2022-12-14 15:05:26,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:05:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:26,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 15:05:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1643916134, now seen corresponding path program 1 times [2022-12-14 15:05:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896969500] [2022-12-14 15:05:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 15:05:26,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:26,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896969500] [2022-12-14 15:05:27,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896969500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093913299] [2022-12-14 15:05:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:27,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:27,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:05:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:27,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:05:27,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 15:05:27,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:05:27,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093913299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:27,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:05:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 15:05:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636939635] [2022-12-14 15:05:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:27,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:05:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:05:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:05:27,119 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 15:05:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:27,155 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-12-14 15:05:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:05:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 50 [2022-12-14 15:05:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:27,157 INFO L225 Difference]: With dead ends: 82 [2022-12-14 15:05:27,157 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 15:05:27,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 15:05:27,158 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 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 15:05:27,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 15:05:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-14 15:05:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-12-14 15:05:27,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-12-14 15:05:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:27,165 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-12-14 15:05:27,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 15:05:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-12-14 15:05:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 15:05:27,166 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:27,166 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] [2022-12-14 15:05:27,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:05:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:27,368 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 15:05:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash -605160261, now seen corresponding path program 1 times [2022-12-14 15:05:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:27,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686852961] [2022-12-14 15:05:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 15:05:27,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:27,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686852961] [2022-12-14 15:05:27,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686852961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:27,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182337423] [2022-12-14 15:05:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:27,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:27,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:27,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:05:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:27,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:05:27,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 15:05:27,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:05:27,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182337423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:27,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:05:27,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 15:05:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425085108] [2022-12-14 15:05:27,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:05:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:05:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:05:27,583 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 15:05:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:27,616 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-12-14 15:05:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:05:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2022-12-14 15:05:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:27,618 INFO L225 Difference]: With dead ends: 65 [2022-12-14 15:05:27,618 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 15:05:27,618 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 15:05:27,619 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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 15:05:27,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:05:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 15:05:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-14 15:05:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 15:05:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-12-14 15:05:27,625 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 54 [2022-12-14 15:05:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:27,625 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-12-14 15:05:27,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 15:05:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-12-14 15:05:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 15:05:27,626 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:27,627 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] [2022-12-14 15:05:27,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:05:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 15:05:27,827 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 15:05:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -493682542, now seen corresponding path program 1 times [2022-12-14 15:05:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620669571] [2022-12-14 15:05:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:27,913 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 15:05:27,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620669571] [2022-12-14 15:05:27,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620669571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726443599] [2022-12-14 15:05:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:27,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:27,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:27,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:05:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:28,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:05:28,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:28,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 15:05:28,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:05:28,109 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 15:05:28,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726443599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:05:28,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182477613] [2022-12-14 15:05:28,125 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2022-12-14 15:05:28,126 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:05:28,128 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:05:28,132 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:05:28,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:05:30,975 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-12-14 15:05:30,984 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 32 for LOIs [2022-12-14 15:05:30,986 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-12-14 15:05:30,995 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-12-14 15:05:31,003 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:05:36,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [182477613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:36,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:05:36,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [4, 4, 4] total 37 [2022-12-14 15:05:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465046498] [2022-12-14 15:05:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:36,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 15:05:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 15:05:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 15:05:36,575 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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 15:05:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:05:44,413 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-12-14 15:05:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 15:05:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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 59 [2022-12-14 15:05:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:05:44,414 INFO L225 Difference]: With dead ends: 128 [2022-12-14 15:05:44,414 INFO L226 Difference]: Without dead ends: 84 [2022-12-14 15:05:44,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 15:05:44,415 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:05:44,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 365 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 15:05:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-14 15:05:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-12-14 15:05:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 15:05:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-12-14 15:05:44,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 59 [2022-12-14 15:05:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:05:44,431 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-12-14 15:05:44,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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 15:05:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-12-14 15:05:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 15:05:44,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:05:44,431 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] [2022-12-14 15:05:44,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:05:44,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 15:05:44,633 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 15:05:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:05:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1063843166, now seen corresponding path program 1 times [2022-12-14 15:05:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:05:44,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168253377] [2022-12-14 15:05:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:05:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:44,752 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 15:05:44,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:05:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168253377] [2022-12-14 15:05:44,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168253377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:05:44,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361565085] [2022-12-14 15:05:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:05:44,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:05:44,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:05:44,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:05:44,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:05:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:05:44,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:05:44,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:05:44,859 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 15:05:44,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:05:44,908 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 15:05:44,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361565085] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:05:44,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276642926] [2022-12-14 15:05:44,912 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-12-14 15:05:44,912 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:05:44,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:05:44,912 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:05:44,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:05:47,374 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-12-14 15:05:47,384 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 67 for LOIs [2022-12-14 15:05:47,396 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-12-14 15:05:47,405 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-12-14 15:05:47,427 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:05:54,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [276642926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:05:54,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:05:54,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 38 [2022-12-14 15:05:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826837766] [2022-12-14 15:05:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:05:54,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 15:05:54,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:05:54,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 15:05:54,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 15:05:54,341 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 15:06:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:06:03,384 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-12-14 15:06:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:06:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 61 [2022-12-14 15:06:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:06:03,385 INFO L225 Difference]: With dead ends: 108 [2022-12-14 15:06:03,385 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 15:06:03,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=386, Invalid=2164, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 15:06:03,386 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:06:03,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 342 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 15:06:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 15:06:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-14 15:06:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 15:06:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-12-14 15:06:03,400 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2022-12-14 15:06:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:06:03,400 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-12-14 15:06:03,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 15:06:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-12-14 15:06:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 15:06:03,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:06:03,401 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] [2022-12-14 15:06:03,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:06:03,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:06:03,603 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 15:06:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:06:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -293812606, now seen corresponding path program 1 times [2022-12-14 15:06:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:06:03,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335302595] [2022-12-14 15:06:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:06:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:06:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:06:03,702 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 15:06:03,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:06:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335302595] [2022-12-14 15:06:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335302595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:06:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093497791] [2022-12-14 15:06:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:06:03,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:06:03,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:06:03,704 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:06:03,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:06:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:06:03,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:06:03,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:06:03,804 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 15:06:03,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:06:03,853 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 15:06:03,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093497791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:06:03,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [221610633] [2022-12-14 15:06:03,856 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-12-14 15:06:03,856 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:06:03,857 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:06:03,857 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:06:03,857 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:06:06,334 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-12-14 15:06:06,343 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-12-14 15:06:06,345 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-12-14 15:06:06,354 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-12-14 15:06:06,373 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:07:26,043 WARN L233 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 215 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:08:01,201 WARN L233 SmtUtils]: Spent 34.46s on a formula simplification. DAG size of input: 221 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:09:20,192 WARN L233 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 297 DAG size of output: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:09:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [221610633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:09:21,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:09:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 38 [2022-12-14 15:09:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641606807] [2022-12-14 15:09:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:09:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 15:09:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:09:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 15:09:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 15:09:21,299 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 15:09:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:09:29,990 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-12-14 15:09:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:09:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 61 [2022-12-14 15:09:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:09:29,991 INFO L225 Difference]: With dead ends: 99 [2022-12-14 15:09:29,991 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 15:09:29,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 200.4s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 15:09:29,992 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:09:29,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 201 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 15:09:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 15:09:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 15:09:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 15:09:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-12-14 15:09:30,007 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 61 [2022-12-14 15:09:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:09:30,007 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-12-14 15:09:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 15:09:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-12-14 15:09:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 15:09:30,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:09:30,008 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] [2022-12-14 15:09:30,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:09:30,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:09:30,210 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 15:09:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:09:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2032604306, now seen corresponding path program 1 times [2022-12-14 15:09:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:09:30,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501732785] [2022-12-14 15:09:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:09:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:09:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:09:30,315 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 15:09:30,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:09:30,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501732785] [2022-12-14 15:09:30,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501732785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:09:30,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892830240] [2022-12-14 15:09:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:09:30,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:09:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:09:30,317 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:09:30,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:09:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:09:30,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:09:30,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:09:30,440 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 15:09:30,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:09:30,491 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 15:09:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892830240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:09:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1645887007] [2022-12-14 15:09:30,494 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-12-14 15:09:30,494 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:09:30,494 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:09:30,494 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:09:30,494 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:09:33,216 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-12-14 15:09:33,225 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-12-14 15:09:33,227 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-12-14 15:09:33,236 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 77 for LOIs [2022-12-14 15:09:33,241 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:10:39,525 WARN L233 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 207 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:10:52,007 WARN L233 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 221 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:10:56,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1645887007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:56,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:10:56,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 39 [2022-12-14 15:10:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31351360] [2022-12-14 15:10:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:56,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 15:10:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 15:10:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 15:10:56,274 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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 15:11:01,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:11:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:11:06,318 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-12-14 15:11:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 15:11:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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 63 [2022-12-14 15:11:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:11:06,318 INFO L225 Difference]: With dead ends: 73 [2022-12-14 15:11:06,318 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 15:11:06,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 146 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 89.2s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 15:11:06,319 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:11:06,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 51 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 15:11:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 15:11:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 15:11:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:11:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 15:11:06,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-12-14 15:11:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:11:06,320 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 15:11:06,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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 15:11:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 15:11:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 15:11:06,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 15:11:06,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 15:11:06,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 15:11:06,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 15:11:06,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 15:11:06,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 15:11:06,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 15:11:06,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 15:11:06,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:11:06,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 15:11:06,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 15:11:13,599 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 528 DAG size of output: 349 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 15:11:23,615 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 530 DAG size of output: 351 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 15:11:33,701 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 525 DAG size of output: 312 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 15:11:46,397 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 521 DAG size of output: 348 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 15:11:56,600 WARN L233 SmtUtils]: Spent 7.59s on a formula simplification. DAG size of input: 531 DAG size of output: 352 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 15:11:56,635 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 15:11:56,635 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 15:11:56,635 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2022-12-14 15:11:56,636 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point L1572(line 1572) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point L1572-1(line 1572) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1572) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point L1630-1(lines 1630 1636) no Hoare annotation was computed. [2022-12-14 15:11:56,636 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1564-1(lines 1564 1579) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1637) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1589-1(lines 1589 1600) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1601) no Hoare annotation was computed. [2022-12-14 15:11:56,637 INFO L899 garLoopResultBuilder]: For program point L1614-1(lines 1614 1620) no Hoare annotation was computed. [2022-12-14 15:11:56,639 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse20 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse56 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse13 (= (select |#length| 6) 18)) (.cse49 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse73 (mod (let ((.cse75 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse77 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse74 (= .cse77 0)) (.cse76 (= .cse75 0)) (.cse78 (= .cse75 .cse77))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse73 2147483647) .cse73 (+ .cse73 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= 21 (select |#length| 5))) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 48 (select |#length| 3))) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.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 |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse57 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse58 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse60 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse43 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse59 (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse4 (mod (+ (* (let ((.cse6 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_146))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse33 (mod (let ((.cse35 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse37 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse34 (= .cse37 0)) (.cse36 (= .cse35 0)) (.cse38 (= .cse37 .cse35))) (ite (= (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse33 2147483647) .cse33 (+ .cse33 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse49 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse50 (mod (let ((.cse52 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse54 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse51 (= .cse54 0)) (.cse53 (= .cse52 0)) (.cse55 (= .cse52 .cse54))) (ite (= (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse50 2147483647) .cse50 (+ .cse50 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse24 .cse25 .cse56 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse39 .cse40 .cse57 .cse41 .cse58 .cse42 .cse44 .cse45 .cse59 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse49 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse56 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse39 .cse40 .cse57 .cse41 .cse58 .cse42 .cse60 .cse44 .cse45 .cse59 .cse46 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse49 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse67 (mod (let ((.cse69 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse32 .cse39 .cse40 .cse57 .cse41 .cse58 .cse42 .cse60 .cse43 .cse44 .cse45 .cse59 .cse46 .cse47 .cse48))) [2022-12-14 15:11:56,639 INFO L895 garLoopResultBuilder]: At program point L1573(line 1573) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:11:56,639 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2022-12-14 15:11:56,639 INFO L899 garLoopResultBuilder]: For program point L1606-2(lines 1606 1613) no Hoare annotation was computed. [2022-12-14 15:11:56,640 INFO L895 garLoopResultBuilder]: At program point L1606-3(lines 1606 1613) the Hoare annotation is: (let ((.cse19 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse50 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse49 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse65 (mod (let ((.cse67 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse69 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse66 (= .cse69 0)) (.cse68 (= .cse67 0)) (.cse70 (= .cse67 .cse69))) (ite (= (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse65 2147483647) .cse65 (+ .cse65 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= 21 (select |#length| 5))) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.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 |#valid| 0) 0)) (.cse31 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse51 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse52 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse43 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse4 (mod (+ (* (let ((.cse6 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_146))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse33 (mod (let ((.cse35 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse37 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse34 (= .cse37 0)) (.cse36 (= .cse35 0)) (.cse38 (= .cse37 .cse35))) (ite (= (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse34 .cse35 (ite .cse36 .cse37 (ite .cse38 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse33 2147483647) .cse33 (+ .cse33 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse49 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse50 .cse25 .cse26 .cse27 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648)) .cse28 .cse29 .cse30 .cse31 .cse32 .cse39 .cse40 .cse41 .cse51 .cse42 .cse52 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse49 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse53 (mod (let ((.cse55 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse55 .cse57))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ .cse53 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse23 .cse24 .cse50 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse39 .cse40 .cse41 .cse51 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse49 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse59 (mod (let ((.cse61 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse63 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse60 (= .cse63 0)) (.cse62 (= .cse61 0)) (.cse64 (= .cse61 .cse63))) (ite (= (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse59 2147483647) .cse59 (+ .cse59 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse31 .cse32 .cse39 .cse40 .cse41 .cse51 .cse42 .cse52 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-12-14 15:11:56,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1572) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= 21 (select |#length| 5))) (.cse19 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.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 |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse4 (mod (+ (* (let ((.cse6 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_146))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse32 (mod (let ((.cse34 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse36 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse33 (= .cse36 0)) (.cse35 (= .cse34 0)) (.cse37 (= .cse36 .cse34))) (ite (= (ite .cse33 .cse34 (ite .cse35 .cse36 (ite .cse37 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse33 .cse34 (ite .cse35 .cse36 (ite .cse37 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse33 .cse34 (ite .cse35 .cse36 (ite .cse37 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse32 2147483647) .cse32 (+ .cse32 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse38 .cse39 .cse40 .cse41 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse47 (mod (let ((.cse49 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse49 .cse51))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_18| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_18| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_18|) (= (let ((.cse53 (mod (let ((.cse55 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_18|)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_18|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse57 .cse55))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_152))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_18|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ .cse53 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_18| 2147483647))) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 15:11:56,641 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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 |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L895 garLoopResultBuilder]: At program point L1566(line 1566) the Hoare annotation is: false [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1599) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1633(line 1633) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1633-1(line 1633) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L902 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: true [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2022-12-14 15:11:56,641 INFO L902 garLoopResultBuilder]: At program point L1650-1(line 1650) the Hoare annotation is: true [2022-12-14 15:11:56,641 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2022-12-14 15:11:56,642 INFO L902 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: true [2022-12-14 15:11:56,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-12-14 15:11:56,643 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: (let ((.cse40 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse7 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse73 (mod (let ((.cse75 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse77 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse74 (= .cse77 0)) (.cse76 (= .cse75 0)) (.cse78 (= .cse75 .cse77))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse73 2147483647) .cse73 (+ .cse73 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse47 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse8 (= (select (select |#memory_int| 1) 0) 0)) (.cse9 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse54 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse17 (= 48 (select |#length| 3))) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse32 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse39 (= ~globalArgc~0 0)) (.cse41 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse26 (mod (let ((.cse28 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse30 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse27 (= .cse30 0)) (.cse29 (= .cse28 0)) (.cse31 (= .cse28 .cse30))) (ite (= (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse26 2147483647) .cse26 (+ .cse26 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse47 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse48 (mod (let ((.cse50 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse52 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse49 (= .cse52 0)) (.cse51 (= .cse50 0)) (.cse53 (= .cse52 .cse50))) (ite (= (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse48 2147483647) .cse48 (+ .cse48 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse54 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse55 (mod (let ((.cse57 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse57 .cse59))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ .cse55 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse17 .cse18 .cse19 .cse47 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse61 (mod (+ (* (let ((.cse63 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_146))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse54 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse67 (mod (let ((.cse69 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse71 .cse69))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse34 .cse35 .cse36 .cse37 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 15:11:56,643 INFO L899 garLoopResultBuilder]: For program point L1593(line 1593) no Hoare annotation was computed. [2022-12-14 15:11:56,643 INFO L899 garLoopResultBuilder]: For program point L1626-1(line 1626) no Hoare annotation was computed. [2022-12-14 15:11:56,643 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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 |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:11:56,643 INFO L899 garLoopResultBuilder]: For program point L1593-1(line 1593) no Hoare annotation was computed. [2022-12-14 15:11:56,643 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-12-14 15:11:56,644 INFO L895 garLoopResultBuilder]: At program point L1626-4(lines 1626 1629) the Hoare annotation is: (let ((.cse40 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse41 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse73 (mod (let ((.cse75 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse77 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse74 (= .cse77 0)) (.cse76 (= .cse75 0)) (.cse78 (= .cse75 .cse77))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse73 2147483647) .cse73 (+ .cse73 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse8 (= (select (select |#memory_int| 1) 0) 0)) (.cse9 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse60 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse17 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse18 (= 48 (select |#length| 3))) (.cse19 (= 16 (select |#length| 7))) (.cse47 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse32 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse26 (mod (let ((.cse28 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse30 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse27 (= .cse30 0)) (.cse29 (= .cse28 0)) (.cse31 (= .cse28 .cse30))) (ite (= (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse27 .cse28 (ite .cse29 .cse30 (ite .cse31 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse26 2147483647) .cse26 (+ .cse26 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse47 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse48 (mod (let ((.cse50 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse52 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse49 (= .cse52 0)) (.cse51 (= .cse50 0)) (.cse53 (= .cse52 .cse50))) (ite (= (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse48 2147483647) .cse48 (+ .cse48 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse54 (mod (+ (* (let ((.cse56 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse58 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse55 (= .cse58 0)) (.cse57 (= .cse56 0)) (.cse59 (= .cse58 .cse56))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_146))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse54 2147483647) .cse54 (+ .cse54 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse60 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse34 .cse35 .cse36 .cse37 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse60 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse67 (mod (let ((.cse69 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse17 .cse18 .cse19 .cse47 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 15:11:56,645 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1563) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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 |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:11:56,646 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse7 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse72 (mod (let ((.cse74 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse76 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse73 (= .cse76 0)) (.cse75 (= .cse74 0)) (.cse77 (= .cse74 .cse76))) (ite (= (ite .cse73 .cse74 (ite .cse75 .cse76 (ite .cse77 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse73 .cse74 (ite .cse75 .cse76 (ite .cse77 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse73 .cse74 (ite .cse75 .cse76 (ite .cse77 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse72 2147483647) .cse72 (+ .cse72 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse53 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse8 (= (select (select |#memory_int| 1) 0) 0)) (.cse9 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse46 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse17 (= 48 (select |#length| 3))) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= (select |#valid| 4) 1)) (.cse20 (= (select |#valid| 1) 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse22 (= ~globalArgv~0.base 0)) (.cse23 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse24 (= (select |#valid| 0) 0)) (.cse31 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse38 (= ~globalArgc~0 0)) (.cse40 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse25 (mod (let ((.cse27 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse29 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse26 (= .cse29 0)) (.cse28 (= .cse27 0)) (.cse30 (= .cse27 .cse29))) (ite (= (ite .cse26 .cse27 (ite .cse28 .cse29 (ite .cse30 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse26 .cse27 (ite .cse28 .cse29 (ite .cse30 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse26 .cse27 (ite .cse28 .cse29 (ite .cse30 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse25 2147483647) .cse25 (+ .cse25 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse46 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse47 (mod (let ((.cse49 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse49 .cse51))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse17 .cse18 .cse53 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse53 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse54 (mod (let ((.cse56 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse58 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse55 (= .cse58 0)) (.cse57 (= .cse56 0)) (.cse59 (= .cse58 .cse56))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse54 2147483647) .cse54 (+ .cse54 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse60 (mod (+ (* (let ((.cse62 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse64 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse61 (= .cse64 0)) (.cse63 (= .cse62 0)) (.cse65 (= .cse64 .cse62))) (ite (= (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_146))) (ite (= (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_147))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse60 2147483647) .cse60 (+ .cse60 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse46 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31 .cse32 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse66 (mod (let ((.cse68 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse70 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse67 (= .cse70 0)) (.cse69 (= .cse68 0)) (.cse71 (= .cse70 .cse68))) (ite (= (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse66 2147483647) .cse66 (+ .cse66 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse33 .cse34 .cse35 .cse36 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45))) [2022-12-14 15:11:56,647 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse13 (= (select |#length| 6) 18)) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= 21 (select |#length| 5))) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.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 |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (= ~globalArgc~0 0)) (.cse36 (= (select |#valid| 6) 1)) (.cse37 (= 5 ~globalFive~0)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 2147483647) (= (let ((.cse5 (mod (+ 4294967295 (* (let ((.cse7 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|)) (.cse9 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|))) (let ((.cse6 (= .cse9 0)) (.cse8 (= 0 .cse7)) (.cse10 (= .cse9 .cse7))) (ite (= (ite .cse6 .cse7 (ite .cse8 .cse9 (ite .cse10 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 0) (ite .cse6 .cse7 (ite .cse8 .cse9 (ite .cse10 0 v_~bitwiseXor_146))) (ite (= (ite .cse6 .cse7 (ite .cse8 .cse9 (ite .cse10 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) 0 v_~bitwiseXor_147))))) 4294967295)) 4294967296))) (ite (<= .cse5 2147483647) .cse5 (+ .cse5 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| 2147483647))) .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_~data~0#1| 2147483648) 0) .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse41 (mod (let ((.cse43 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse43 .cse45))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_152))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse38 .cse39 .cse40))) [2022-12-14 15:11:56,647 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-12-14 15:11:56,648 INFO L895 garLoopResultBuilder]: At program point L1585-4(lines 1585 1588) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= 21 (select |#length| 5))) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 48 (select |#length| 3))) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#valid| 0) 0)) (.cse30 (= (select |#length| 1) 1)) (.cse31 (= (select |#valid| 2) 1)) (.cse32 (= |#NULL.offset| 0)) (.cse33 (= ~globalFalse~0 0)) (.cse34 (= ~globalArgc~0 0)) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse37 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_151 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19| Int) (v_~bitwiseXor_149 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse4 (mod (let ((.cse6 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19|)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_152))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19|))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse38 (mod (let ((.cse40 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse42 .cse40))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ .cse38 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 2147483647) (= (let ((.cse46 (mod (+ 4294967295 (* (let ((.cse48 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= 0 .cse48)) (.cse51 (= .cse50 .cse48))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_146))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) 0 v_~bitwiseXor_147))))) 4294967295)) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| 2147483647))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse52 (mod (let ((.cse54 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse56 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse53 (= .cse56 0)) (.cse55 (= .cse54 0)) (.cse57 (= .cse56 .cse54))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse52 2147483647) .cse52 (+ .cse52 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse31 .cse32 .cse33 .cse34 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse35 .cse36 .cse37 .cse44 .cse45))) [2022-12-14 15:11:56,648 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 2147483647) (= (let ((.cse0 (mod (+ 4294967295 (* (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= 0 .cse2)) (.cse5 (= .cse4 .cse2))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_146))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_17|) 0 v_~bitwiseXor_147))))) 4294967295)) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_17| 2147483647))) (= |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 |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:11:56,648 INFO L899 garLoopResultBuilder]: For program point L1577-1(lines 1556 1580) no Hoare annotation was computed. [2022-12-14 15:11:56,649 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1621) no Hoare annotation was computed. [2022-12-14 15:11:56,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 15:11:56,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-12-14 15:11:56,649 INFO L895 garLoopResultBuilder]: At program point L1594(line 1594) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (not (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0))) (.cse8 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse38 (mod (let ((.cse40 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse40 .cse42))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ .cse38 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= (select |#valid| 7) 1)) (.cse14 (= 21 (select |#length| 5))) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse18 (= 48 (select |#length| 3))) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse26 (= (select |#length| 1) 1)) (.cse27 (= (select |#valid| 2) 1)) (.cse28 (= |#NULL.offset| 0)) (.cse29 (= ~globalFalse~0 0)) (.cse30 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse31 (= ~globalArgc~0 0)) (.cse32 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse33 (= (select |#valid| 6) 1)) (.cse34 (= 5 ~globalFive~0)) (.cse35 (< 0 |#StackHeapBarrier|)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= ~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 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (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 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse33 .cse34 .cse35 .cse36 .cse37))) [2022-12-14 15:11:56,649 INFO L899 garLoopResultBuilder]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2022-12-14 15:11:56,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-12-14 15:11:56,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-12-14 15:11:56,650 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-12-14 15:11:56,650 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2022-12-14 15:11:56,653 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:11:56,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:11:56,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:11:56 BoogieIcfgContainer [2022-12-14 15:11:56,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:11:56,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:11:56,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:11:56,663 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:11:56,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:05:24" (3/4) ... [2022-12-14 15:11:56,666 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 15:11:56,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 15:11:56,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-12-14 15:11:56,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 15:11:56,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-12-14 15:11:56,676 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-12-14 15:11:56,676 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-14 15:11:56,677 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 15:11:56,677 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 15:11:56,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:11:56,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:11:56,707 INFO L158 Benchmark]: Toolchain (without parser) took 393618.02ms. Allocated memory was 127.9MB in the beginning and 323.0MB in the end (delta: 195.0MB). Free memory was 89.0MB in the beginning and 176.9MB in the end (delta: -88.0MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,707 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:11:56,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 749.20ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 89.0MB in the beginning and 136.5MB in the end (delta: -47.5MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 132.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,708 INFO L158 Benchmark]: Boogie Preprocessor took 20.98ms. Allocated memory is still 184.5MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,708 INFO L158 Benchmark]: RCFGBuilder took 494.28ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 98.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,708 INFO L158 Benchmark]: TraceAbstraction took 392261.99ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 98.6MB in the beginning and 181.1MB in the end (delta: -82.6MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,708 INFO L158 Benchmark]: Witness Printer took 43.89ms. Allocated memory is still 323.0MB. Free memory was 181.1MB in the beginning and 176.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:11:56,709 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.18ms. Allocated memory is still 127.9MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 749.20ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 89.0MB in the beginning and 136.5MB in the end (delta: -47.5MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 132.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.98ms. Allocated memory is still 184.5MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.28ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 98.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 392261.99ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 98.6MB in the beginning and 181.1MB in the end (delta: -82.6MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. * Witness Printer took 43.89ms. Allocated memory is still 323.0MB. Free memory was 181.1MB in the beginning and 176.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: 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, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 392.2s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 2406 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1617 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4237 IncrementalHoareTripleChecker+Invalid, 4410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 789 mSDtfsCounter, 4237 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1046 GetRequests, 801 SyntacticMatches, 24 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 314.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 95 PreInvPairs, 126 NumberOfFragments, 22703 HoareAnnotationTreeSize, 95 FomulaSimplifications, 1141 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 23 FomulaSimplificationsInter, 40869 FormulaSimplificationTreeSizeReductionInter, 49.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1757 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 696/716 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: 10.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 212, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 132, TOOLS_POST_TIME: 2.7s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 4.2s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 2.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 372, TOOLS_QUANTIFIERELIM_TIME: 9.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 512, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 0.9s, 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: 212, DOMAIN_ISBOTTOM_TIME: 0.4s, 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: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, 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: 6464, DAG_COMPRESSION_RETAINED_NODES: 524, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1650]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 15:11:56,916 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-14 15:11:56,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edf816-4120-4679-a777-6747fce5d125/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE