./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur --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 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e --- 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-38b53e6 [2022-11-25 23:35:23,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:35:23,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:35:23,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:35:23,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:35:23,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:35:23,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:35:23,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:35:23,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:35:23,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:35:23,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:35:23,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:35:23,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:35:23,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:35:23,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:35:23,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:35:23,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:35:23,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:35:23,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:35:23,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:35:23,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:35:23,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:35:23,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:35:23,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:35:23,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:35:23,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:35:23,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:35:23,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:35:23,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:35:23,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:35:23,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:35:23,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:35:23,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:35:23,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:35:23,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:35:23,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:35:23,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:35:23,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:35:23,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:35:23,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:35:23,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:35:23,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-25 23:35:23,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:35:23,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:35:23,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:35:23,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:35:23,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:35:23,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:35:23,152 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:35:23,153 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:35:23,153 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:35:23,153 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:35:23,154 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:35:23,154 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:35:23,154 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:35:23,155 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:35:23,155 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:35:23,155 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:35:23,155 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:35:23,155 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:35:23,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:35:23,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:35:23,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:35:23,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:35:23,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:35:23,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:35:23,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:35:23,158 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:35:23,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:35:23,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:35:23,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:35:23,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:35:23,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:35:23,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:23,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:35:23,160 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:35:23,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:35:23,162 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_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/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_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur 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 -> 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e [2022-11-25 23:35:23,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:35:23,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:35:23,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:35:23,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:35:23,522 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:35:23,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-25 23:35:26,576 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:35:26,938 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:35:26,938 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-25 23:35:26,968 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/data/35483811b/52705b59adb5421bae258af887eb15c9/FLAG84c799a68 [2022-11-25 23:35:26,982 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/data/35483811b/52705b59adb5421bae258af887eb15c9 [2022-11-25 23:35:26,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:35:26,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:35:26,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:26,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:35:26,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:35:26,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:26" (1/1) ... [2022-11-25 23:35:26,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba7c5b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:26, skipping insertion in model container [2022-11-25 23:35:26,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:26" (1/1) ... [2022-11-25 23:35:27,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:35:27,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:35:27,478 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:35:27,997 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 23:35:28,003 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 23:35:28,005 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 23:35:28,007 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 23:35:28,008 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 23:35:28,040 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 23:35:28,048 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 23:35:28,057 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 23:35:28,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:28,070 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:35:28,090 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:35:28,195 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 23:35:28,201 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 23:35:28,206 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 23:35:28,233 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 23:35:28,234 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 23:35:28,239 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 23:35:28,242 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 23:35:28,251 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 23:35:28,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:28,398 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:35:28,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28 WrapperNode [2022-11-25 23:35:28,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:28,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:28,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:35:28,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:35:28,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,487 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2022-11-25 23:35:28,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:28,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:35:28,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:35:28,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:35:28,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:35:28,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:35:28,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:35:28,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:35:28,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (1/1) ... [2022-11-25 23:35:28,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:28,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:28,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:35:28,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:35:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 23:35:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 23:35:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-25 23:35:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 23:35:28,638 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 23:35:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:35:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 23:35:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:35:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:35:28,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:35:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-11-25 23:35:28,639 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-11-25 23:35:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:35:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-11-25 23:35:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-11-25 23:35:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 23:35:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:35:28,811 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:35:28,813 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:35:29,117 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:35:29,175 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:35:29,183 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:35:29,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:29 BoogieIcfgContainer [2022-11-25 23:35:29,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:35:29,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:35:29,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:35:29,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:35:29,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:35:26" (1/3) ... [2022-11-25 23:35:29,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f4390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:29, skipping insertion in model container [2022-11-25 23:35:29,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:28" (2/3) ... [2022-11-25 23:35:29,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f4390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:29, skipping insertion in model container [2022-11-25 23:35:29,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:29" (3/3) ... [2022-11-25 23:35:29,199 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-25 23:35:29,219 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:35:29,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 23:35:29,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:35:29,276 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;@15b4a3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:35:29,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 23:35:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 23:35:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:35:29,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:29,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:29,289 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-11-25 23:35:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 529550636, now seen corresponding path program 1 times [2022-11-25 23:35:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:29,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904909909] [2022-11-25 23:35:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:29,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:29,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904909909] [2022-11-25 23:35:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904909909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:29,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:29,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499510782] [2022-11-25 23:35:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:29,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:29,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:29,813 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 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-11-25 23:35:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:29,956 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-25 23:35:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:29,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-11-25 23:35:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:29,967 INFO L225 Difference]: With dead ends: 137 [2022-11-25 23:35:29,967 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 23:35:29,976 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-11-25 23:35:29,979 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:35:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 23:35:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 23:35:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 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-11-25 23:35:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-25 23:35:30,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-25 23:35:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:30,045 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-25 23:35:30,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-11-25 23:35:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-25 23:35:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:35:30,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:30,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:30,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:35:30,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1357069969, now seen corresponding path program 1 times [2022-11-25 23:35:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:30,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80825234] [2022-11-25 23:35:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:30,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80825234] [2022-11-25 23:35:30,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80825234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:30,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:30,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782081155] [2022-11-25 23:35:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:30,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:30,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:30,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:30,273 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:35:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:30,356 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-11-25 23:35:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-11-25 23:35:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:30,361 INFO L225 Difference]: With dead ends: 68 [2022-11-25 23:35:30,362 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 23:35:30,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:30,366 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 44 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:30,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 174 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 23:35:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 23:35:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 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-11-25 23:35:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-11-25 23:35:30,376 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-11-25 23:35:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:30,376 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-11-25 23:35:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:35:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-11-25 23:35:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:35:30,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:30,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:35:30,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -880503844, now seen corresponding path program 1 times [2022-11-25 23:35:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:30,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297482749] [2022-11-25 23:35:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:30,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:30,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297482749] [2022-11-25 23:35:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297482749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:30,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:30,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015755816] [2022-11-25 23:35:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:30,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:30,492 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:35:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:30,529 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-25 23:35:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-11-25 23:35:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:30,534 INFO L225 Difference]: With dead ends: 67 [2022-11-25 23:35:30,535 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:35:30,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:30,541 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:30,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:35:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 23:35:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.368421052631579) internal successors, (52), 51 states have internal predecessors, (52), 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-11-25 23:35:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-25 23:35:30,559 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 20 [2022-11-25 23:35:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:30,559 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-25 23:35:30,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:35:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-25 23:35:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:35:30,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:30,562 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, 1, 1] [2022-11-25 23:35:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:35:30,563 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-11-25 23:35:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 337295568, now seen corresponding path program 1 times [2022-11-25 23:35:30,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:30,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715069992] [2022-11-25 23:35:30,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:30,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:35:30,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:30,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715069992] [2022-11-25 23:35:30,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715069992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:30,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:30,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795673240] [2022-11-25 23:35:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:30,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:30,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:30,709 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-25 23:35:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:30,755 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2022-11-25 23:35:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 33 [2022-11-25 23:35:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:30,757 INFO L225 Difference]: With dead ends: 114 [2022-11-25 23:35:30,757 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:35:30,758 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-11-25 23:35:30,759 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:30,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:35:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 23:35:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 50 states have internal predecessors, (51), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 23:35:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-11-25 23:35:30,769 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 33 [2022-11-25 23:35:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:30,770 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-11-25 23:35:30,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-25 23:35:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-11-25 23:35:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:35:30,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:30,772 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, 1, 1, 1] [2022-11-25 23:35:30,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:35:30,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -871225187, now seen corresponding path program 1 times [2022-11-25 23:35:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:30,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901521921] [2022-11-25 23:35:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:35:30,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901521921] [2022-11-25 23:35:30,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901521921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220987923] [2022-11-25 23:35:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:30,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:30,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:35:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:31,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:35:31,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:35:31,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:31,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220987923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:31,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:35:31,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:35:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902964408] [2022-11-25 23:35:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:31,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:31,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:35:31,062 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:35:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:31,102 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2022-11-25 23:35:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-25 23:35:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:31,104 INFO L225 Difference]: With dead ends: 106 [2022-11-25 23:35:31,104 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:35:31,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-11-25 23:35:31,106 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:31,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:35:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 23:35:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 23:35:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-25 23:35:31,116 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 34 [2022-11-25 23:35:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:31,116 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-25 23:35:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:35:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-11-25 23:35:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:35:31,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:31,118 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, 1, 1, 1, 1, 1] [2022-11-25 23:35:31,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:31,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:31,324 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -292091166, now seen corresponding path program 1 times [2022-11-25 23:35:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:31,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444192524] [2022-11-25 23:35:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:35:31,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444192524] [2022-11-25 23:35:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444192524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:31,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:31,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896167377] [2022-11-25 23:35:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:31,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:31,474 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:35:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:31,513 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-11-25 23:35:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:31,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-11-25 23:35:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:31,515 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:35:31,515 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:35:31,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:31,516 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:31,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 178 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:35:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 23:35:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 23:35:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-11-25 23:35:31,526 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 36 [2022-11-25 23:35:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:31,527 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-11-25 23:35:31,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:35:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-11-25 23:35:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:35:31,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:31,529 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, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:31,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:35:31,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash -464891443, now seen corresponding path program 1 times [2022-11-25 23:35:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:31,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201763430] [2022-11-25 23:35:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:35:31,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201763430] [2022-11-25 23:35:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201763430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:31,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:31,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:35:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848889454] [2022-11-25 23:35:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:35:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:35:31,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:31,635 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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-11-25 23:35:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:31,663 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-11-25 23:35:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:35:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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 37 [2022-11-25 23:35:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:31,666 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:35:31,666 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:35:31,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:35:31,673 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:31,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:35:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 23:35:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 48 states have internal predecessors, (48), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 23:35:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-11-25 23:35:31,688 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2022-11-25 23:35:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:31,688 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-11-25 23:35:31,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (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-11-25 23:35:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-11-25 23:35:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:35:31,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:31,698 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:31,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:35:31,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 834591959, now seen corresponding path program 1 times [2022-11-25 23:35:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:31,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441213031] [2022-11-25 23:35:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:35:31,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:31,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441213031] [2022-11-25 23:35:31,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441213031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:31,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851101590] [2022-11-25 23:35:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:31,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:31,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:31,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:31,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:35:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:31,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:35:31,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:35:32,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851101590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:32,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:35:32,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:35:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314385938] [2022-11-25 23:35:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:35:32,004 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 23:35:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:32,040 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-11-25 23:35:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-11-25 23:35:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:32,042 INFO L225 Difference]: With dead ends: 94 [2022-11-25 23:35:32,042 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:35:32,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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-11-25 23:35:32,044 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:32,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:35:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 23:35:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.236842105263158) internal successors, (47), 47 states have internal predecessors, (47), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 23:35:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-25 23:35:32,078 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 46 [2022-11-25 23:35:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:32,079 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-25 23:35:32,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 23:35:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2022-11-25 23:35:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 23:35:32,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:32,084 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, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:32,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:32,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1367423486, now seen corresponding path program 1 times [2022-11-25 23:35:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129703514] [2022-11-25 23:35:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 23:35:32,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:32,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129703514] [2022-11-25 23:35:32,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129703514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:32,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608170900] [2022-11-25 23:35:32,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:32,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:32,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:32,453 INFO L87 Difference]: Start difference. First operand 63 states and 81 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, (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-11-25 23:35:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:32,497 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2022-11-25 23:35:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:32,497 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, (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 50 [2022-11-25 23:35:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:32,499 INFO L225 Difference]: With dead ends: 80 [2022-11-25 23:35:32,499 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:35:32,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:32,503 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:32,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:35:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-25 23:35:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 50 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 23:35:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-11-25 23:35:32,521 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 50 [2022-11-25 23:35:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:32,522 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-11-25 23:35:32,523 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, (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-11-25 23:35:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-11-25 23:35:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:35:32,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:32,527 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:32,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:35:32,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:35:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash 441083458, now seen corresponding path program 1 times [2022-11-25 23:35:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:32,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353531909] [2022-11-25 23:35:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 23:35:32,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:32,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353531909] [2022-11-25 23:35:32,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353531909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:32,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:32,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931739805] [2022-11-25 23:35:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:32,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:32,648 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 23:35:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:32,685 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-11-25 23:35:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2022-11-25 23:35:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:32,687 INFO L225 Difference]: With dead ends: 85 [2022-11-25 23:35:32,687 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:35:32,688 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-11-25 23:35:32,689 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:32,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:35:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-25 23:35:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) 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), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:35:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-11-25 23:35:32,703 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 53 [2022-11-25 23:35:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:32,704 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-25 23:35:32,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 23:35:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-11-25 23:35:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 23:35:32,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:32,705 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] [2022-11-25 23:35:32,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:35:32,705 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-11-25 23:35:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1035400911, now seen corresponding path program 1 times [2022-11-25 23:35:32,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:32,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792674814] [2022-11-25 23:35:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:35:32,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792674814] [2022-11-25 23:35:32,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792674814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297284015] [2022-11-25 23:35:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:32,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:32,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:35:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:32,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:35:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 23:35:32,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:32,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297284015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:32,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:35:32,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 23:35:32,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599703112] [2022-11-25 23:35:32,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:32,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:35:32,973 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-11-25 23:35:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:33,012 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-25 23:35:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 60 [2022-11-25 23:35:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:33,014 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:35:33,014 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 23:35:33,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-11-25 23:35:33,015 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:33,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 23:35:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-25 23:35:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.131578947368421) 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), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 23:35:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-25 23:35:33,027 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 60 [2022-11-25 23:35:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:33,027 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-25 23:35:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-11-25 23:35:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-25 23:35:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 23:35:33,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:33,031 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:33,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:33,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:33,237 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-11-25 23:35:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash 87309473, now seen corresponding path program 1 times [2022-11-25 23:35:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072070222] [2022-11-25 23:35:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:35:33,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072070222] [2022-11-25 23:35:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072070222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531891126] [2022-11-25 23:35:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:33,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:33,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:33,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:35:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:33,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:35:33,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:35:33,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:35:33,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531891126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:33,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365154320] [2022-11-25 23:35:33,700 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-25 23:35:33,701 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:33,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:33,710 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:33,711 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:34,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:34,454 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-25 23:35:34,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-25 23:35:34,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:35:34,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:34,534 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:35:34,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-25 23:35:34,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:34,785 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-25 23:35:34,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-25 23:35:34,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:35:34,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:34,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:35:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,241 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:35:36,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-25 23:35:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,540 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-25 23:35:36,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-25 23:35:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:36,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-25 23:35:36,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:35:36,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:35:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:36,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:35:40,069 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-25 23:35:40,072 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-25 23:35:40,109 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-25 23:35:40,253 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-25 23:35:40,266 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:52,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1365154320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:35:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-25 23:35:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499604878] [2022-11-25 23:35:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:52,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:35:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:35:52,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:35:52,700 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:35:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:59,232 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2022-11-25 23:35:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 23:35:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-11-25 23:35:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:59,234 INFO L225 Difference]: With dead ends: 183 [2022-11-25 23:35:59,234 INFO L226 Difference]: Without dead ends: 118 [2022-11-25 23:35:59,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-11-25 23:35:59,237 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 108 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:59,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 410 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 23:35:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-25 23:35:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2022-11-25 23:35:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 71 states have internal predecessors, (72), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-25 23:35:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2022-11-25 23:35:59,266 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 65 [2022-11-25 23:35:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:59,267 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2022-11-25 23:35:59,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:35:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2022-11-25 23:35:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:35:59,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:59,268 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:59,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:59,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 23:35:59,475 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-11-25 23:35:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1468235832, now seen corresponding path program 1 times [2022-11-25 23:35:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223349261] [2022-11-25 23:35:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:35:59,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223349261] [2022-11-25 23:35:59,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223349261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:35:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451694046] [2022-11-25 23:35:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:59,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:59,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:35:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:59,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:35:59,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:35:59,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:35:59,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451694046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1630220727] [2022-11-25 23:35:59,882 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-25 23:35:59,882 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:59,883 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:59,883 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:59,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:00,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:00,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:00,312 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-25 23:36:00,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-25 23:36:00,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:00,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-25 23:36:00,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:00,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-25 23:36:00,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:00,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:00,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:36:01,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:01,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:01,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,392 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:36:01,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-25 23:36:01,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:36:01,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-25 23:36:01,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,547 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 23:36:01,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-11-25 23:36:01,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:01,796 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-25 23:36:01,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-11-25 23:36:13,996 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-25 23:36:13,997 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-11-25 23:36:14,000 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-11-25 23:36:14,002 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-25 23:36:14,112 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:39,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1630220727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:39,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:36:39,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-25 23:36:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15151621] [2022-11-25 23:36:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:36:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:36:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:36:39,239 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 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-11-25 23:36:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:46,134 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-11-25 23:36:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 23:36:46,135 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 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 67 [2022-11-25 23:36:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:46,135 INFO L225 Difference]: With dead ends: 122 [2022-11-25 23:36:46,136 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:36:46,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 149 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=285, Invalid=2165, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 23:36:46,138 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:46,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 430 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-25 23:36:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:36:46,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-11-25 23:36:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 47 states have internal predecessors, (47), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 23:36:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-11-25 23:36:46,156 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 67 [2022-11-25 23:36:46,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:46,156 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-11-25 23:36:46,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 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-11-25 23:36:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-11-25 23:36:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 23:36:46,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:46,158 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:46,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:46,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:36:46,363 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-11-25 23:36:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash -444824086, now seen corresponding path program 1 times [2022-11-25 23:36:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853254707] [2022-11-25 23:36:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:36:46,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853254707] [2022-11-25 23:36:46,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853254707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667905057] [2022-11-25 23:36:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:46,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:46,522 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:46,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:36:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:46,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:36:46,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:36:46,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 23:36:46,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667905057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230462248] [2022-11-25 23:36:46,802 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-25 23:36:46,802 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:46,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:46,804 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:46,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:47,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:47,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:47,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,090 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:36:47,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-25 23:36:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,259 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-25 23:36:47,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-25 23:36:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,487 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-25 23:36:47,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-25 23:36:47,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:36:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,462 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:36:48,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-25 23:36:48,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,702 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-25 23:36:48,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-25 23:36:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,755 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:36:48,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-25 23:36:48,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:48,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:48,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:48,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:36:51,524 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-25 23:36:51,526 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-25 23:36:51,628 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-25 23:36:51,739 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-25 23:36:51,839 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [230462248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:10,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:10,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-25 23:37:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457278846] [2022-11-25 23:37:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:10,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 23:37:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 23:37:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:37:10,481 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:37:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:18,483 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-11-25 23:37:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 23:37:18,484 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-25 23:37:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:18,485 INFO L225 Difference]: With dead ends: 136 [2022-11-25 23:37:18,486 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 23:37:18,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=331, Invalid=2531, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 23:37:18,488 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 58 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:18,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 23:37:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 23:37:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2022-11-25 23:37:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 23:37:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-25 23:37:18,515 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 67 [2022-11-25 23:37:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:18,515 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-25 23:37:18,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:37:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-25 23:37:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 23:37:18,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:18,517 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:18,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 23:37:18,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:18,722 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 23:37:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1188993857, now seen corresponding path program 1 times [2022-11-25 23:37:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644939724] [2022-11-25 23:37:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:37:18,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:18,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644939724] [2022-11-25 23:37:18,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644939724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:18,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463393210] [2022-11-25 23:37:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:18,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:18,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:18,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:37:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:18,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:37:18,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:37:19,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 23:37:19,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463393210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:19,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [67944795] [2022-11-25 23:37:19,110 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-25 23:37:19,110 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:19,115 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:19,115 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:19,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:19,464 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-25 23:37:19,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-25 23:37:19,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:19,697 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-25 23:37:19,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-25 23:37:19,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:19,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:19,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-25 23:37:19,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:19,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:37:20,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:20,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:20,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:20,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:20,737 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:37:20,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-25 23:37:20,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:20,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:21,005 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-25 23:37:21,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-25 23:37:21,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:21,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:21,060 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:37:21,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-25 23:37:21,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:21,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:21,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:21,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-25 23:37:23,804 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-25 23:37:23,806 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-11-25 23:37:23,808 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-25 23:37:23,933 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-25 23:37:23,947 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [67944795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [5, 5, 5] total 47 [2022-11-25 23:37:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878249806] [2022-11-25 23:37:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 23:37:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 23:37:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1973, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 23:37:40,590 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:37:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:46,925 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-25 23:37:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 23:37:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-11-25 23:37:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:46,926 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:37:46,926 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:37:46,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 156 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=347, Invalid=2733, Unknown=0, NotChecked=0, Total=3080 [2022-11-25 23:37:46,928 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:46,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 119 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 23:37:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:37:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:37:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:37:46,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-25 23:37:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:46,930 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:37:46,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 23:37:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:37:46,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:37:46,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 23:37:46,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 23:37:46,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 23:37:46,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 23:37:46,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 23:37:46,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 23:37:46,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 23:37:46,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 23:37:46,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:37:47,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:38:13,460 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 23:38:13,461 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 23:38:13,461 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-11-25 23:38:13,461 INFO L902 garLoopResultBuilder]: At program point staticReturnsFalseENTRY(lines 1552 1555) the Hoare annotation is: true [2022-11-25 23:38:13,462 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 23:38:13,462 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 23:38:13,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-11-25 23:38:13,463 INFO L895 garLoopResultBuilder]: At program point L1596(line 1596) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .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 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) .cse27) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-25 23:38:13,463 INFO L899 garLoopResultBuilder]: For program point L1596-1(line 1596) no Hoare annotation was computed. [2022-11-25 23:38:13,463 INFO L899 garLoopResultBuilder]: For program point L1596-2(lines 1596 1609) no Hoare annotation was computed. [2022-11-25 23:38:13,464 INFO L895 garLoopResultBuilder]: At program point L1596-4(lines 1596 1609) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse12) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-25 23:38:13,464 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (store ((as const (Array Int Int)) 0) 0 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,464 INFO L899 garLoopResultBuilder]: For program point L1588-1(lines 1574 1590) no Hoare annotation was computed. [2022-11-25 23:38:13,465 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1589) no Hoare annotation was computed. [2022-11-25 23:38:13,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 23:38:13,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-11-25 23:38:13,465 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: false [2022-11-25 23:38:13,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:38:13,465 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-11-25 23:38:13,466 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-25 23:38:13,466 INFO L899 garLoopResultBuilder]: For program point L1614-1(line 1614) no Hoare annotation was computed. [2022-11-25 23:38:13,467 INFO L895 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,467 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-11-25 23:38:13,467 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-11-25 23:38:13,467 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point L1639-1(line 1639) no Hoare annotation was computed. [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point L1606-1(lines 1600 1607) no Hoare annotation was computed. [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-25 23:38:13,468 INFO L899 garLoopResultBuilder]: For program point L1582(line 1582) no Hoare annotation was computed. [2022-11-25 23:38:13,469 INFO L899 garLoopResultBuilder]: For program point L1582-1(line 1582) no Hoare annotation was computed. [2022-11-25 23:38:13,470 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-25 23:38:13,470 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1590) no Hoare annotation was computed. [2022-11-25 23:38:13,470 INFO L899 garLoopResultBuilder]: For program point L1624(lines 1624 1644) no Hoare annotation was computed. [2022-11-25 23:38:13,471 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: (let ((.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse32 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse53 .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse20) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse55 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse55 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-25 23:38:13,471 INFO L895 garLoopResultBuilder]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse40 (store ((as const (Array Int Int)) 0) 0 0)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse40) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse40) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-25 23:38:13,472 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-11-25 23:38:13,472 INFO L895 garLoopResultBuilder]: At program point L1649-4(lines 1649 1652) the Hoare annotation is: (let ((.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse44 (store ((as const (Array Int Int)) 0) 0 0)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse43 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (= (select |#valid| 10) 1)) (.cse49 (= (select |#valid| 8) 1)) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse44) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse54 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse55 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse54 .cse17 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse44) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse55 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52))) [2022-11-25 23:38:13,473 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-25 23:38:13,474 INFO L895 garLoopResultBuilder]: At program point L1641(line 1641) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse21 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse54 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse43 (store ((as const (Array Int Int)) 0) 0 0)) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse43) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse52 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse54 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse52 .cse17 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse43) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse54 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse43) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-25 23:38:13,474 INFO L902 garLoopResultBuilder]: At program point L1674-1(line 1674) the Hoare annotation is: true [2022-11-25 23:38:13,474 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1607) no Hoare annotation was computed. [2022-11-25 23:38:13,474 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 23:38:13,474 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1623) no Hoare annotation was computed. [2022-11-25 23:38:13,475 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,475 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-11-25 23:38:13,475 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-11-25 23:38:13,476 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,476 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-11-25 23:38:13,476 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-11-25 23:38:13,477 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,477 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-11-25 23:38:13,477 INFO L899 garLoopResultBuilder]: For program point L1610-1(lines 1610 1622) no Hoare annotation was computed. [2022-11-25 23:38:13,477 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:38:13,477 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-11-25 23:38:13,477 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-25 23:38:13,478 INFO L899 garLoopResultBuilder]: For program point L1636-1(lines 1636 1643) no Hoare annotation was computed. [2022-11-25 23:38:13,478 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 23:38:13,478 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-11-25 23:38:13,479 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-11-25 23:38:13,479 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse19) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse52 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse53 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse53 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse19) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse52 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-25 23:38:13,480 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2022-11-25 23:38:13,480 INFO L899 garLoopResultBuilder]: For program point L1628-2(lines 1628 1635) no Hoare annotation was computed. [2022-11-25 23:38:13,481 INFO L895 garLoopResultBuilder]: At program point L1628-3(lines 1628 1635) the Hoare annotation is: (let ((.cse50 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse51 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse53 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse51 .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse20) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 .cse52 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse53 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse52 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse51 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse53 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-25 23:38:13,481 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-11-25 23:38:13,481 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-25 23:38:13,482 INFO L899 garLoopResultBuilder]: For program point L1653-1(lines 1653 1660) no Hoare annotation was computed. [2022-11-25 23:38:13,482 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1661) no Hoare annotation was computed. [2022-11-25 23:38:13,485 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1621) no Hoare annotation was computed. [2022-11-25 23:38:13,485 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 23:38:13,485 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-11-25 23:38:13,485 INFO L902 garLoopResultBuilder]: At program point staticReturnsTrueENTRY(lines 1548 1551) the Hoare annotation is: true [2022-11-25 23:38:13,490 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:13,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:38:13,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:38:13 BoogieIcfgContainer [2022-11-25 23:38:13,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:38:13,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:38:13,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:38:13,505 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:38:13,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:29" (3/4) ... [2022-11-25 23:38:13,508 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:38:13,514 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 23:38:13,514 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-11-25 23:38:13,515 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 23:38:13,515 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-11-25 23:38:13,523 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-25 23:38:13,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:38:13,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 23:38:13,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:38:13,525 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:38:13,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:38:13,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:38:13,586 INFO L158 Benchmark]: Toolchain (without parser) took 166600.30ms. Allocated memory was 119.5MB in the beginning and 484.4MB in the end (delta: 364.9MB). Free memory was 76.1MB in the beginning and 379.7MB in the end (delta: -303.6MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,587 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 95.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:38:13,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1411.07ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 75.9MB in the beginning and 90.9MB in the end (delta: -15.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.18ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 87.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,589 INFO L158 Benchmark]: Boogie Preprocessor took 39.89ms. Allocated memory is still 157.3MB. Free memory was 87.4MB in the beginning and 85.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,589 INFO L158 Benchmark]: RCFGBuilder took 661.58ms. Allocated memory is still 157.3MB. Free memory was 85.3MB in the beginning and 116.8MB in the end (delta: -31.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,589 INFO L158 Benchmark]: TraceAbstraction took 164311.72ms. Allocated memory was 157.3MB in the beginning and 484.4MB in the end (delta: 327.2MB). Free memory was 116.8MB in the beginning and 383.9MB in the end (delta: -267.1MB). Peak memory consumption was 292.9MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,590 INFO L158 Benchmark]: Witness Printer took 81.41ms. Allocated memory is still 484.4MB. Free memory was 383.9MB in the beginning and 379.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:38:13,601 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.19ms. Allocated memory is still 119.5MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 95.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1411.07ms. Allocated memory was 119.5MB in the beginning and 157.3MB in the end (delta: 37.7MB). Free memory was 75.9MB in the beginning and 90.9MB in the end (delta: -15.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.18ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 87.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.89ms. Allocated memory is still 157.3MB. Free memory was 87.4MB in the beginning and 85.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 661.58ms. Allocated memory is still 157.3MB. Free memory was 85.3MB in the beginning and 116.8MB in the end (delta: -31.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 164311.72ms. Allocated memory was 157.3MB in the beginning and 484.4MB in the end (delta: 327.2MB). Free memory was 116.8MB in the beginning and 383.9MB in the end (delta: -267.1MB). Peak memory consumption was 292.9MB. Max. memory is 16.1GB. * Witness Printer took 81.41ms. Allocated memory is still 484.4MB. Free memory was 383.9MB in the beginning and 379.7MB 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 164.2s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 3385 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2394 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6250 IncrementalHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 991 mSDtfsCounter, 6250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 757 SyntacticMatches, 29 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3390 ImplicationChecksByTransitivity, 84.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 130 PreInvPairs, 169 NumberOfFragments, 9716 HoareAnnotationTreeSize, 130 FomulaSimplifications, 808 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 25 FomulaSimplificationsInter, 23413 FormulaSimplificationTreeSizeReductionInter, 25.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1621 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1965 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 622/638 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: 30.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 236, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 156, TOOLS_POST_TIME: 11.9s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 9.9s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 5.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 396, TOOLS_QUANTIFIERELIM_TIME: 26.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 560, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 2.7s, 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: 236, DOMAIN_ISBOTTOM_TIME: 0.7s, 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: 7356, DAG_COMPRESSION_RETAINED_NODES: 572, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1674]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 23:38:13,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6520d07d-27a0-4db5-9a9b-c6c2222bfd74/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE