./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:15:10,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:15:10,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:15:10,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:15:10,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:15:10,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:15:10,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:15:10,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:15:10,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:15:10,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:15:10,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:15:10,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:15:10,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:15:10,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:15:10,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:15:10,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:15:10,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:15:10,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:15:10,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:15:10,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:15:10,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:15:10,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:15:10,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:15:10,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:15:10,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:15:10,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:15:10,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:15:10,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:15:10,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:15:10,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:15:10,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:15:10,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:15:10,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:15:10,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:15:10,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:15:10,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:15:10,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:15:10,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:15:10,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:15:10,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:15:10,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:15:10,299 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 07:15:10,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:15:10,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:15:10,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:15:10,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:15:10,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:15:10,322 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:15:10,322 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:15:10,322 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:15:10,323 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:15:10,323 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:15:10,323 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:15:10,323 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:15:10,323 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:15:10,324 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:15:10,324 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:15:10,324 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:15:10,324 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:15:10,324 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:15:10,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:15:10,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:15:10,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:15:10,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:15:10,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:15:10,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:15:10,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:15:10,326 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 07:15:10,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:15:10,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:15:10,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:15:10,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:15:10,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:15:10,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:15:10,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:15:10,328 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:15:10,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:15:10,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:15:10,329 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:15:10,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:15:10,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:15:10,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:15:10,329 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_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 [2022-12-14 07:15:10,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:15:10,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:15:10,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:15:10,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:15:10,552 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:15:10,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-12-14 07:15:13,101 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:15:13,311 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:15:13,311 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-12-14 07:15:13,324 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/data/7ba3554b7/6093000a93f34f738fd5f20a04e99d4f/FLAGe0215ccd2 [2022-12-14 07:15:13,337 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/data/7ba3554b7/6093000a93f34f738fd5f20a04e99d4f [2022-12-14 07:15:13,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:15:13,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:15:13,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:15:13,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:15:13,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:15:13,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:15:13" (1/1) ... [2022-12-14 07:15:13,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd4624b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:13, skipping insertion in model container [2022-12-14 07:15:13,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:15:13" (1/1) ... [2022-12-14 07:15:13,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:15:13,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:15:13,671 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 07:15:14,045 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 07:15:14,050 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 07:15:14,052 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 07:15:14,055 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 07:15:14,056 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 07:15:14,080 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 07:15:14,087 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 07:15:14,097 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 07:15:14,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:15:14,108 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:15:14,129 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 07:15:14,176 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 07:15:14,178 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 07:15:14,179 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 07:15:14,181 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 07:15:14,182 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 07:15:14,187 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 07:15:14,190 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 07:15:14,194 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 07:15:14,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:15:14,273 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:15:14,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14 WrapperNode [2022-12-14 07:15:14,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:15:14,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:15:14,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:15:14,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:15:14,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,321 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-12-14 07:15:14,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:15:14,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:15:14,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:15:14,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:15:14,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:15:14,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:15:14,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:15:14,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:15:14,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (1/1) ... [2022-12-14 07:15:14,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:15:14,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:14,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:15:14,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 07:15:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 07:15:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 07:15:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:15:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-12-14 07:15:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-12-14 07:15:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 07:15:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:15:14,548 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:15:14,550 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:15:14,711 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:15:14,736 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:15:14,736 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 07:15:14,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:15:14 BoogieIcfgContainer [2022-12-14 07:15:14,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:15:14,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:15:14,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:15:14,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:15:14,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:15:13" (1/3) ... [2022-12-14 07:15:14,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bcf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:15:14, skipping insertion in model container [2022-12-14 07:15:14,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:15:14" (2/3) ... [2022-12-14 07:15:14,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bcf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:15:14, skipping insertion in model container [2022-12-14 07:15:14,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:15:14" (3/3) ... [2022-12-14 07:15:14,744 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-12-14 07:15:14,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:15:14,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 07:15:14,794 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:15:14,799 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;@468519d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:15:14,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 07:15:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:15:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:15:14,808 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:14,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:14,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1213796289, now seen corresponding path program 1 times [2022-12-14 07:15:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:14,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949120889] [2022-12-14 07:15:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:15,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:15,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949120889] [2022-12-14 07:15:15,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949120889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:15,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:15,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:15:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085899515] [2022-12-14 07:15:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:15,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:15:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:15:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:15:15,074 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:15:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:15,140 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-12-14 07:15:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:15:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2022-12-14 07:15:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:15,148 INFO L225 Difference]: With dead ends: 145 [2022-12-14 07:15:15,148 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 07:15:15,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:15:15,153 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:15,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 07:15:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-14 07:15:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 07:15:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-12-14 07:15:15,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-12-14 07:15:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:15,184 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-14 07:15:15,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:15:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-12-14 07:15:15,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:15:15,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:15,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:15,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:15:15,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1718655748, now seen corresponding path program 1 times [2022-12-14 07:15:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:15,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910135259] [2022-12-14 07:15:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:15,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:15,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910135259] [2022-12-14 07:15:15,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910135259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:15,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:15,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:15:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896983835] [2022-12-14 07:15:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:15,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:15,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:15,258 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:15,299 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2022-12-14 07:15:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-14 07:15:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:15,301 INFO L225 Difference]: With dead ends: 174 [2022-12-14 07:15:15,301 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 07:15:15,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:15,302 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:15,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 183 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 07:15:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2022-12-14 07:15:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 07:15:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2022-12-14 07:15:15,312 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 20 [2022-12-14 07:15:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:15,312 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-12-14 07:15:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2022-12-14 07:15:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 07:15:15,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:15,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:15,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:15:15,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1738720556, now seen corresponding path program 1 times [2022-12-14 07:15:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:15,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846016789] [2022-12-14 07:15:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:15,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:15,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846016789] [2022-12-14 07:15:15,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846016789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:15,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:15,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:15:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333706804] [2022-12-14 07:15:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:15,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:15,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:15,387 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:15,418 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2022-12-14 07:15:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-12-14 07:15:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:15,420 INFO L225 Difference]: With dead ends: 120 [2022-12-14 07:15:15,421 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 07:15:15,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:15,423 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:15,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 215 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 07:15:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2022-12-14 07:15:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 07:15:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-12-14 07:15:15,438 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-12-14 07:15:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:15,438 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-12-14 07:15:15,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 07:15:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-12-14 07:15:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 07:15:15,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:15,440 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:15:15,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash -134839580, now seen corresponding path program 1 times [2022-12-14 07:15:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:15,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064961780] [2022-12-14 07:15:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:15:15,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:15,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064961780] [2022-12-14 07:15:15,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064961780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:15,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47995666] [2022-12-14 07:15:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:15,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:15,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:15:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:15,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:15:15,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:15:15,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:15,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47995666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:15,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:15,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 07:15:15,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97750790] [2022-12-14 07:15:15,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:15,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:15,674 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 07:15:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:15,703 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-12-14 07:15:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-12-14 07:15:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:15,705 INFO L225 Difference]: With dead ends: 146 [2022-12-14 07:15:15,706 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 07:15:15,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:15,707 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:15,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 07:15:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-12-14 07:15:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:15:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 07:15:15,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-12-14 07:15:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:15,721 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 07:15:15,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 07:15:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 07:15:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 07:15:15,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:15,723 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:15,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:15:15,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:15,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash 7536895, now seen corresponding path program 1 times [2022-12-14 07:15:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:15,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704103277] [2022-12-14 07:15:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:15:16,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704103277] [2022-12-14 07:15:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704103277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:16,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:15:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462972233] [2022-12-14 07:15:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:16,089 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 07:15:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:16,119 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-12-14 07:15:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-12-14 07:15:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:16,122 INFO L225 Difference]: With dead ends: 106 [2022-12-14 07:15:16,122 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 07:15:16,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:16,123 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:16,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 186 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 07:15:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-12-14 07:15:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:15:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 07:15:16,134 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-12-14 07:15:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:16,134 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 07:15:16,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 07:15:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 07:15:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 07:15:16,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:16,136 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:15:16,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash 233643865, now seen corresponding path program 1 times [2022-12-14 07:15:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688148031] [2022-12-14 07:15:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:15:16,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688148031] [2022-12-14 07:15:16,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688148031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:16,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:16,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:15:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776570639] [2022-12-14 07:15:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:16,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:16,189 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 07:15:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:16,216 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-12-14 07:15:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:16,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-12-14 07:15:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:16,218 INFO L225 Difference]: With dead ends: 105 [2022-12-14 07:15:16,218 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 07:15:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:15:16,219 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:16,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 07:15:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-12-14 07:15:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:15:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-12-14 07:15:16,230 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-12-14 07:15:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:16,230 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-12-14 07:15:16,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 07:15:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-12-14 07:15:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 07:15:16,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:16,233 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:16,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:15:16,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1168894102, now seen corresponding path program 1 times [2022-12-14 07:15:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:16,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80799250] [2022-12-14 07:15:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:15:16,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:16,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80799250] [2022-12-14 07:15:16,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80799250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:16,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901115474] [2022-12-14 07:15:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:16,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:16,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:15:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:15:16,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 07:15:16,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:16,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901115474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:16,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:16,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 07:15:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140714912] [2022-12-14 07:15:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:16,381 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:15:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:16,403 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2022-12-14 07:15:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:16,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-12-14 07:15:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:16,404 INFO L225 Difference]: With dead ends: 79 [2022-12-14 07:15:16,405 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 07:15:16,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:16,406 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:16,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 07:15:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-14 07:15:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:15:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2022-12-14 07:15:16,414 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 42 [2022-12-14 07:15:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:16,415 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2022-12-14 07:15:16,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:15:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2022-12-14 07:15:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 07:15:16,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:16,416 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:16,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:15:16,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:16,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1875978641, now seen corresponding path program 1 times [2022-12-14 07:15:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:16,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312176502] [2022-12-14 07:15:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:15:16,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:16,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312176502] [2022-12-14 07:15:16,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312176502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:16,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76607060] [2022-12-14 07:15:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:16,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:16,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:16,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:16,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:15:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:16,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:15:16,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 07:15:16,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76607060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 07:15:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318686924] [2022-12-14 07:15:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:16,860 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:15:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:16,882 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2022-12-14 07:15:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:16,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-12-14 07:15:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:16,884 INFO L225 Difference]: With dead ends: 110 [2022-12-14 07:15:16,884 INFO L226 Difference]: Without dead ends: 96 [2022-12-14 07:15:16,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:16,894 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:16,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-14 07:15:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-12-14 07:15:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:15:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-12-14 07:15:16,903 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 43 [2022-12-14 07:15:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:16,903 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-12-14 07:15:16,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:15:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-12-14 07:15:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 07:15:16,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:16,905 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:16,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:15:17,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 07:15:17,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1020701275, now seen corresponding path program 1 times [2022-12-14 07:15:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:17,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287060069] [2022-12-14 07:15:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:15:17,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287060069] [2022-12-14 07:15:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287060069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062650458] [2022-12-14 07:15:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:17,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:17,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:17,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:15:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:17,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:15:17,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 07:15:17,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:17,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062650458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:17,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:17,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 07:15:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353189212] [2022-12-14 07:15:17,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:15:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:17,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:15:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:17,347 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:15:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:17,370 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-12-14 07:15:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:15:17,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-12-14 07:15:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:17,372 INFO L225 Difference]: With dead ends: 111 [2022-12-14 07:15:17,372 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 07:15:17,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:15:17,373 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:17,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 07:15:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-12-14 07:15:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:15:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-12-14 07:15:17,382 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 46 [2022-12-14 07:15:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:17,382 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-12-14 07:15:17,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:15:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-12-14 07:15:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 07:15:17,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:17,384 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:17,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 07:15:17,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:17,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1416369249, now seen corresponding path program 1 times [2022-12-14 07:15:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:17,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353951039] [2022-12-14 07:15:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:17,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353951039] [2022-12-14 07:15:17,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353951039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588197480] [2022-12-14 07:15:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:17,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:17,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:17,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:15:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:17,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:15:17,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:15:17,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:17,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588197480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:17,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:17,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 07:15:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525843889] [2022-12-14 07:15:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:15:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:15:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:17,852 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:17,878 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2022-12-14 07:15:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:15:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2022-12-14 07:15:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:17,880 INFO L225 Difference]: With dead ends: 120 [2022-12-14 07:15:17,880 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 07:15:17,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:17,881 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:17,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 07:15:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 07:15:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 61 states have internal predecessors, (69), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:15:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 07:15:17,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 52 [2022-12-14 07:15:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:17,888 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 07:15:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 07:15:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 07:15:17,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:17,889 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:17,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 07:15:18,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 07:15:18,090 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 990334522, now seen corresponding path program 1 times [2022-12-14 07:15:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:18,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748384976] [2022-12-14 07:15:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:18,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:18,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748384976] [2022-12-14 07:15:18,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748384976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:18,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774731236] [2022-12-14 07:15:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:18,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:18,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:15:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:18,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:15:18,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:15:18,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:18,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774731236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:18,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:18,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 07:15:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286020450] [2022-12-14 07:15:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:18,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:15:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:15:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:18,259 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:18,288 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-12-14 07:15:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:15:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2022-12-14 07:15:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:18,290 INFO L225 Difference]: With dead ends: 116 [2022-12-14 07:15:18,290 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 07:15:18,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:18,291 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:18,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 07:15:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 07:15:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 61 states have internal predecessors, (67), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:15:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2022-12-14 07:15:18,298 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 54 [2022-12-14 07:15:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:18,298 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2022-12-14 07:15:18,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-12-14 07:15:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 07:15:18,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:18,299 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:18,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:15:18,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:18,500 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 892417623, now seen corresponding path program 1 times [2022-12-14 07:15:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:18,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533596192] [2022-12-14 07:15:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:18,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533596192] [2022-12-14 07:15:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533596192] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485185012] [2022-12-14 07:15:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:18,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:18,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:15:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:18,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:15:18,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:15:18,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:15:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485185012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:18,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:15:18,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 07:15:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465084394] [2022-12-14 07:15:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:18,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:15:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:15:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:18,690 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:18,720 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2022-12-14 07:15:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:15:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-12-14 07:15:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:18,722 INFO L225 Difference]: With dead ends: 94 [2022-12-14 07:15:18,722 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 07:15:18,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:15:18,723 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:18,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 07:15:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-12-14 07:15:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 61 states have internal predecessors, (65), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:15:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2022-12-14 07:15:18,731 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 55 [2022-12-14 07:15:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:18,731 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2022-12-14 07:15:18,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 07:15:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-12-14 07:15:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 07:15:18,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:18,733 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:18,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:15:18,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:18,934 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash -862020414, now seen corresponding path program 1 times [2022-12-14 07:15:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:18,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267965088] [2022-12-14 07:15:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:15:18,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:18,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267965088] [2022-12-14 07:15:18,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267965088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:18,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:15:18,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:15:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973907078] [2022-12-14 07:15:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:18,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:15:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:15:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:15:18,995 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 07:15:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:19,017 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-12-14 07:15:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:15:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 59 [2022-12-14 07:15:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:19,018 INFO L225 Difference]: With dead ends: 96 [2022-12-14 07:15:19,018 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 07:15:19,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:15:19,019 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:19,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:15:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 07:15:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-14 07:15:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.196078431372549) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 07:15:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-12-14 07:15:19,025 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 59 [2022-12-14 07:15:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:19,025 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-12-14 07:15:19,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 07:15:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-12-14 07:15:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 07:15:19,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:19,027 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:19,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:15:19,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash 259066415, now seen corresponding path program 1 times [2022-12-14 07:15:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209175415] [2022-12-14 07:15:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:19,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209175415] [2022-12-14 07:15:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209175415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:19,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805885372] [2022-12-14 07:15:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:19,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:19,122 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:19,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:15:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:19,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:15:19,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:19,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 07:15:19,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805885372] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:19,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854391411] [2022-12-14 07:15:19,344 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-12-14 07:15:19,344 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:15:19,348 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:15:19,351 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:15:19,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:15:19,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:19,783 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 07:15:19,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 07:15:19,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:19,852 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 07:15:19,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 07:15:19,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,018 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:15:20,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:15:20,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:20,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:15:20,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:20,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,790 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:15:20,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:15:20,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:20,978 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:15:20,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:15:21,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:21,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:21,018 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:21,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:15:21,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:21,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:15:23,076 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:15:23,078 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 07:15:23,114 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:15:23,219 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 07:15:23,232 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:15:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1854391411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:15:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:15:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-12-14 07:15:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666600504] [2022-12-14 07:15:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:15:31,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 07:15:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:15:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 07:15:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:15:31,544 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:15:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:50,229 INFO L93 Difference]: Finished difference Result 308 states and 385 transitions. [2022-12-14 07:15:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 07:15:50,230 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 61 [2022-12-14 07:15:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:50,231 INFO L225 Difference]: With dead ends: 308 [2022-12-14 07:15:50,231 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 07:15:50,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=913, Invalid=5567, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 07:15:50,233 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:50,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 433 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-12-14 07:15:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 07:15:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2022-12-14 07:15:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.105263157894737) internal successors, (84), 82 states have internal predecessors, (84), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-12-14 07:15:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2022-12-14 07:15:50,251 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 61 [2022-12-14 07:15:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:50,251 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2022-12-14 07:15:50,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 07:15:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2022-12-14 07:15:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 07:15:50,252 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:50,252 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:15:50,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 07:15:50,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 07:15:50,454 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:15:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash -76248875, now seen corresponding path program 1 times [2022-12-14 07:15:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699606613] [2022-12-14 07:15:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:15:50,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699606613] [2022-12-14 07:15:50,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699606613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709033995] [2022-12-14 07:15:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:50,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:50,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:15:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:50,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:15:50,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:15:50,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:15:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:15:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709033995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:15:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1165628743] [2022-12-14 07:15:50,732 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 07:15:50,732 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:15:50,733 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:15:50,733 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:15:50,733 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:15:50,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:50,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,002 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:15:51,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:15:51,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 07:15:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 07:15:51,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:15:51,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:51,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:15:51,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,706 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:15:51,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:15:51,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:15:51,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:15:51,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,809 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 07:15:51,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-12-14 07:15:51,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:51,999 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 07:15:51,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-12-14 07:15:59,156 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:15:59,158 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 210 for LOIs [2022-12-14 07:15:59,260 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-12-14 07:15:59,262 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 64 for LOIs [2022-12-14 07:15:59,270 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:16:14,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1165628743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:16:14,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:16:14,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-12-14 07:16:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783239435] [2022-12-14 07:16:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:16:14,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 07:16:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:16:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 07:16:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:16:14,017 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:16:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:16:24,447 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2022-12-14 07:16:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 07:16:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-12-14 07:16:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:16:24,448 INFO L225 Difference]: With dead ends: 206 [2022-12-14 07:16:24,448 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 07:16:24,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 143 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 07:16:24,450 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 154 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:16:24,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 405 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 07:16:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 07:16:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2022-12-14 07:16:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 82 states have internal predecessors, (84), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-14 07:16:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2022-12-14 07:16:24,469 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 65 [2022-12-14 07:16:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:16:24,470 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2022-12-14 07:16:24,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:16:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2022-12-14 07:16:24,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 07:16:24,470 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:16:24,470 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:16:24,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 07:16:24,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 07:16:24,672 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:16:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:16:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash -471939903, now seen corresponding path program 1 times [2022-12-14 07:16:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:16:24,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898183408] [2022-12-14 07:16:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:16:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:16:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:16:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:24,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:16:24,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898183408] [2022-12-14 07:16:24,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898183408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:16:24,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565029841] [2022-12-14 07:16:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:16:24,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:16:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:16:24,771 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:16:24,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 07:16:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:16:24,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:16:24,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:16:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:24,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:16:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:24,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565029841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:16:24,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543402426] [2022-12-14 07:16:24,936 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 07:16:24,936 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:16:24,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:16:24,936 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:16:24,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:16:25,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:25,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:25,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:25,113 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 07:16:25,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 07:16:25,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:25,205 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 07:16:25,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 07:16:25,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:25,332 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:16:25,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:16:25,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:25,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:16:25,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:25,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:25,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:25,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,015 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:16:26,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:16:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,156 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:16:26,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:16:26,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:16:26,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:16:26,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:26,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:16:27,912 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:16:27,914 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 07:16:27,938 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:16:28,016 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 07:16:28,100 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:16:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1543402426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:16:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:16:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-12-14 07:16:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496097781] [2022-12-14 07:16:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:16:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 07:16:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:16:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 07:16:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:16:37,438 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:16:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:16:47,851 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2022-12-14 07:16:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 07:16:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-12-14 07:16:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:16:47,852 INFO L225 Difference]: With dead ends: 222 [2022-12-14 07:16:47,852 INFO L226 Difference]: Without dead ends: 172 [2022-12-14 07:16:47,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=466, Invalid=2840, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 07:16:47,853 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 201 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:16:47,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 527 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-14 07:16:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-14 07:16:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2022-12-14 07:16:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.0761904761904761) internal successors, (113), 111 states have internal predecessors, (113), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 07:16:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2022-12-14 07:16:47,883 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 65 [2022-12-14 07:16:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:16:47,883 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2022-12-14 07:16:47,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:16:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2022-12-14 07:16:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:16:47,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:16:47,885 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:16:47,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 07:16:48,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 07:16:48,086 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:16:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:16:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 592957579, now seen corresponding path program 1 times [2022-12-14 07:16:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:16:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040163581] [2022-12-14 07:16:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:16:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:16:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:16:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:48,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:16:48,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040163581] [2022-12-14 07:16:48,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040163581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:16:48,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632475340] [2022-12-14 07:16:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:16:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:16:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:16:48,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:16:48,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 07:16:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:16:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:16:48,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:16:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:48,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:16:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:16:48,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632475340] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:16:48,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629905797] [2022-12-14 07:16:48,356 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 07:16:48,356 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:16:48,356 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:16:48,356 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:16:48,357 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:16:48,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:48,623 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 07:16:48,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 07:16:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:48,758 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:16:48,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:16:48,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:48,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:48,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 07:16:48,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:48,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:16:49,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:49,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,267 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:16:49,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:16:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,455 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:16:49,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:16:49,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:16:49,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:16:49,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:16:49,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:16:49,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:16:51,612 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:16:51,613 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-12-14 07:16:51,713 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:16:51,801 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 07:16:51,808 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:17:02,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [629905797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:17:02,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:17:02,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 07:17:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676261560] [2022-12-14 07:17:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:17:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 07:17:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:17:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 07:17:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 07:17:02,110 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:17:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:11,819 INFO L93 Difference]: Finished difference Result 200 states and 232 transitions. [2022-12-14 07:17:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 07:17:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-12-14 07:17:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:11,820 INFO L225 Difference]: With dead ends: 200 [2022-12-14 07:17:11,820 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 07:17:11,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 07:17:11,822 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:11,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 254 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 07:17:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 07:17:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-14 07:17:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.077922077922078) internal successors, (83), 82 states have internal predecessors, (83), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:17:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2022-12-14 07:17:11,841 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 67 [2022-12-14 07:17:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:11,841 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2022-12-14 07:17:11,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:17:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2022-12-14 07:17:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:17:11,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:11,842 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:17:11,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 07:17:12,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 07:17:12,044 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:17:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -752681417, now seen corresponding path program 1 times [2022-12-14 07:17:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:17:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612136760] [2022-12-14 07:17:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:17:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:17:12,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:17:12,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612136760] [2022-12-14 07:17:12,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612136760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:12,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65319836] [2022-12-14 07:17:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:12,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:12,128 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:12,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 07:17:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:12,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:17:12,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:17:12,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 07:17:12,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65319836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:17:12,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301512827] [2022-12-14 07:17:12,283 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 07:17:12,283 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:17:12,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:17:12,284 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:17:12,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:17:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:12,416 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 07:17:12,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 07:17:12,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:12,544 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:17:12,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:17:12,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:12,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 07:17:12,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:12,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:12,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:12,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:17:13,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,309 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:17:13,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:17:13,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,362 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:13,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:17:13,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,467 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-12-14 07:17:13,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 85 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 12 case distinctions, treesize of input 77 treesize of output 137 [2022-12-14 07:17:13,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:13,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:13,680 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 07:17:13,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 161 treesize of output 209 [2022-12-14 07:17:14,468 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:17:14,470 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-12-14 07:17:14,543 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-12-14 07:17:14,588 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 07:17:14,595 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:17:20,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [301512827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:17:20,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:17:20,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 07:17:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762598585] [2022-12-14 07:17:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:17:20,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 07:17:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:17:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 07:17:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1669, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 07:17:20,720 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:17:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:31,034 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2022-12-14 07:17:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 07:17:31,035 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-12-14 07:17:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:31,036 INFO L225 Difference]: With dead ends: 169 [2022-12-14 07:17:31,036 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 07:17:31,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 153 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=605, Invalid=3555, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 07:17:31,037 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:31,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 564 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 07:17:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 07:17:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2022-12-14 07:17:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 07:17:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-12-14 07:17:31,062 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 67 [2022-12-14 07:17:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:31,062 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-12-14 07:17:31,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 07:17:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-12-14 07:17:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 07:17:31,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:31,063 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:17:31,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 07:17:31,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 07:17:31,264 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:17:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 377399911, now seen corresponding path program 1 times [2022-12-14 07:17:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:17:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144744907] [2022-12-14 07:17:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:17:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:17:31,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:17:31,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144744907] [2022-12-14 07:17:31,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144744907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:31,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117875491] [2022-12-14 07:17:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:31,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:31,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:31,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:31,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 07:17:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:31,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:17:31,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:17:31,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:17:31,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117875491] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:17:31,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [887093424] [2022-12-14 07:17:31,496 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 07:17:31,496 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:17:31,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:17:31,497 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:17:31,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:17:31,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:31,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:31,732 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 07:17:31,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 07:17:31,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:31,767 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 07:17:31,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 07:17:31,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:31,883 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:17:31,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:17:31,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:31,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:17:32,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:32,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:32,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,534 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:17:32,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:17:32,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,677 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:17:32,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:17:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,706 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:32,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:17:32,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:32,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:17:34,629 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:17:34,631 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 07:17:34,659 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:17:34,745 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 07:17:34,748 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:17:43,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [887093424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:17:43,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:17:43,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-12-14 07:17:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784341871] [2022-12-14 07:17:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:17:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 07:17:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:17:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 07:17:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 07:17:43,232 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:17:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:17:46,406 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-12-14 07:17:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 07:17:46,407 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-12-14 07:17:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:17:46,407 INFO L225 Difference]: With dead ends: 141 [2022-12-14 07:17:46,407 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 07:17:46,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 07:17:46,409 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:17:46,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 187 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 07:17:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 07:17:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2022-12-14 07:17:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 74 states have internal predecessors, (74), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 07:17:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2022-12-14 07:17:46,449 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 69 [2022-12-14 07:17:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:17:46,449 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2022-12-14 07:17:46,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:17:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-12-14 07:17:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 07:17:46,450 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:17:46,450 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:17:46,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 07:17:46,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:46,652 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:17:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:17:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1537223267, now seen corresponding path program 1 times [2022-12-14 07:17:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:17:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366051910] [2022-12-14 07:17:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:17:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:17:46,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:17:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366051910] [2022-12-14 07:17:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366051910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:17:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329867811] [2022-12-14 07:17:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:17:46,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:17:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:17:46,765 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:17:46,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 07:17:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:17:46,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:17:46,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:17:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:17:46,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:17:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:17:46,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329867811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:17:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [149715584] [2022-12-14 07:17:46,939 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-12-14 07:17:46,940 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:17:46,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:17:46,940 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:17:46,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:17:47,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,189 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:17:47,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:17:47,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 07:17:47,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 07:17:47,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:47,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:17:47,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:47,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:17:47,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,830 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:17:47,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:17:47,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:17:47,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:17:47,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:47,976 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 07:17:47,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-12-14 07:17:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:48,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:17:48,110 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 07:17:48,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 205 [2022-12-14 07:17:58,040 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:17:58,041 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 07:17:58,042 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-12-14 07:17:58,043 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 07:17:58,118 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:18:17,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [149715584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:18:17,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:18:17,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-12-14 07:18:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303077549] [2022-12-14 07:18:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:18:17,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 07:18:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:18:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 07:18:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:18:17,395 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:18:19,412 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-12-14 07:18:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 07:18:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-12-14 07:18:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:18:19,413 INFO L225 Difference]: With dead ends: 114 [2022-12-14 07:18:19,413 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 07:18:19,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 159 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:18:19,414 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:18:19,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 148 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 07:18:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 07:18:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-14 07:18:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 07:18:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-12-14 07:18:19,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 71 [2022-12-14 07:18:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:18:19,431 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-12-14 07:18:19,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-12-14 07:18:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 07:18:19,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:18:19,432 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:18:19,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 07:18:19,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:18:19,633 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:18:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:18:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash -310560547, now seen corresponding path program 1 times [2022-12-14 07:18:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:18:19,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466861609] [2022-12-14 07:18:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:18:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:18:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:18:19,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:18:19,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466861609] [2022-12-14 07:18:19,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466861609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:18:19,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861622802] [2022-12-14 07:18:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:18:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:18:19,723 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:18:19,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 07:18:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:18:19,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:18:19,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:18:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:18:19,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:18:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 07:18:19,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861622802] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:18:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [581406398] [2022-12-14 07:18:19,884 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-12-14 07:18:19,884 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:18:19,884 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:18:19,884 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:18:19,884 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:18:20,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,133 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:18:20,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:18:20,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 07:18:20,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:20,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:20,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 07:18:20,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:18:20,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:20,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:20,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,878 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:18:20,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:18:20,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:20,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:21,060 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:18:21,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:18:21,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:21,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:21,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:18:21,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:18:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:21,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:18:23,414 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:18:23,416 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 215 for LOIs [2022-12-14 07:18:23,496 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:18:23,570 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 07:18:23,643 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:18:36,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [581406398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:18:36,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:18:36,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-12-14 07:18:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713065438] [2022-12-14 07:18:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:18:36,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 07:18:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:18:36,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 07:18:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 07:18:36,164 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:18:39,680 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-12-14 07:18:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 07:18:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-12-14 07:18:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:18:39,682 INFO L225 Difference]: With dead ends: 95 [2022-12-14 07:18:39,682 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 07:18:39,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:18:39,682 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:18:39,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 119 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 07:18:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 07:18:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 07:18:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-12-14 07:18:39,699 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 71 [2022-12-14 07:18:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:18:39,699 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-12-14 07:18:39,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-12-14 07:18:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 07:18:39,699 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:18:39,700 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:18:39,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 07:18:39,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:18:39,901 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 07:18:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:18:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1242259821, now seen corresponding path program 1 times [2022-12-14 07:18:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:18:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246408524] [2022-12-14 07:18:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:18:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:18:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:18:39,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:18:39,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246408524] [2022-12-14 07:18:39,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246408524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:18:39,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165806338] [2022-12-14 07:18:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:18:39,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:18:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:18:39,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:18:39,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 07:18:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:18:40,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:18:40,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:18:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:18:40,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:18:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 07:18:40,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165806338] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:18:40,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [705041414] [2022-12-14 07:18:40,131 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-12-14 07:18:40,131 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:18:40,131 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:18:40,131 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:18:40,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:18:40,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:40,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:40,277 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 07:18:40,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 07:18:40,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:40,399 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 07:18:40,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 07:18:40,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:40,559 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 07:18:40,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 07:18:40,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:40,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:18:41,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,296 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 07:18:41,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 07:18:41,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,441 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 07:18:41,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 07:18:41,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,484 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:18:41,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 07:18:41,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:41,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 07:18:41,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:18:41,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 07:18:43,786 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 07:18:43,787 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 07:18:43,789 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 07:18:43,875 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 07:18:43,881 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:18:55,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [705041414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:18:55,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:18:55,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-12-14 07:18:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925847253] [2022-12-14 07:18:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:18:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 07:18:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:18:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 07:18:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 07:18:55,896 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:18:57,714 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-12-14 07:18:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 07:18:57,715 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 73 [2022-12-14 07:18:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:18:57,715 INFO L225 Difference]: With dead ends: 68 [2022-12-14 07:18:57,715 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 07:18:57,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 170 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=339, Invalid=1823, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 07:18:57,716 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:18:57,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 07:18:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 07:18:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 07:18:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:18:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 07:18:57,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-12-14 07:18:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:18:57,717 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 07:18:57,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 07:18:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 07:18:57,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 07:18:57,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 07:18:57,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 07:18:57,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 07:18:57,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 07:19:08,230 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 545 DAG size of output: 326 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 07:19:15,239 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 544 DAG size of output: 325 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 07:19:35,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 07:19:35,496 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 07:19:35,496 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-12-14 07:19:35,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2022-12-14 07:19:35,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 07:19:35,496 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 07:19:35,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-14 07:19:35,496 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-14 07:19:35,496 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1591) no Hoare annotation was computed. [2022-12-14 07:19:35,497 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1556 1593) no Hoare annotation was computed. [2022-12-14 07:19:35,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-14 07:19:35,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-12-14 07:19:35,497 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 07:19:35,497 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|) 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,497 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1625) no Hoare annotation was computed. [2022-12-14 07:19:35,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-12-14 07:19:35,498 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse47 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse47 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8))))) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) .cse47) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 .cse38) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) [2022-12-14 07:19:35,498 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-12-14 07:19:35,498 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1611) no Hoare annotation was computed. [2022-12-14 07:19:35,499 INFO L895 garLoopResultBuilder]: At program point L1598-4(lines 1598 1611) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse37 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= 51 (select |#length| 5))) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse37 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse13) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse37) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-12-14 07:19:35,500 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (<= (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|) 0)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse13) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse38) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1590) no Hoare annotation was computed. [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point L1640(line 1640) no Hoare annotation was computed. [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point L1640-1(lines 1640 1647) no Hoare annotation was computed. [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-12-14 07:19:35,500 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1592) no Hoare annotation was computed. [2022-12-14 07:19:35,501 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: (let ((.cse64 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse65 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse52 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (<= .cse65 0)) (.cse56 (< 0 .cse65)) (.cse61 (<= .cse64 0)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse51 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse60 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (< 0 .cse64)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= 51 (select |#length| 5))) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse55 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse43 (= ~globalArgc~0 0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse52) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse52) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse42 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse52) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse40 .cse41 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse43 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse58 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse42 .cse43 .cse63 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)))) [2022-12-14 07:19:35,501 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2022-12-14 07:19:35,501 INFO L899 garLoopResultBuilder]: For program point L1632-2(lines 1632 1639) no Hoare annotation was computed. [2022-12-14 07:19:35,502 INFO L895 garLoopResultBuilder]: At program point L1632-3(lines 1632 1639) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse65 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse64 (store ((as const (Array Int Int)) 0) 0 0)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|))) (let ((.cse53 (< 0 .cse66)) (.cse54 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse64) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10))))) (.cse22 (<= .cse65 0)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse57 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse48 (<= 0 .cse65)) (.cse61 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse64 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse63 (<= .cse67 0)) (.cse60 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse52 (< 0 .cse67)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (<= .cse66 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse56 (= .cse65 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= 51 (select |#length| 5))) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse64 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse57 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse62 .cse63 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse57 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse64) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse58 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51)))) [2022-12-14 07:19:35,502 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-12-14 07:19:35,502 INFO L899 garLoopResultBuilder]: For program point L1657-1(lines 1657 1664) no Hoare annotation was computed. [2022-12-14 07:19:35,502 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1665) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1624) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse50 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= 51 (select |#length| 8))) (.cse11 (= (select |#valid| 11) 1)) (.cse12 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse13 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse17 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse18 (= (select |#valid| 3) 1)) (.cse19 (= 21 (select |#length| 4))) (.cse20 (= (select |#valid| 7) 1)) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= (select |#length| 10) 18)) (.cse24 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse50 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 .cse50) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-12-14 07:19:35,503 INFO L899 garLoopResultBuilder]: For program point L1608-1(lines 1602 1609) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L899 garLoopResultBuilder]: For program point L1584(line 1584) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L899 garLoopResultBuilder]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2022-12-14 07:19:35,503 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-12-14 07:19:35,503 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: false [2022-12-14 07:19:35,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-12-14 07:19:35,504 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-12-14 07:19:35,504 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) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,504 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-12-14 07:19:35,504 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-12-14 07:19:35,505 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) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,505 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-12-14 07:19:35,505 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,505 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-12-14 07:19:35,506 INFO L895 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,506 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-12-14 07:19:35,506 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1609) no Hoare annotation was computed. [2022-12-14 07:19:35,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 07:19:35,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-12-14 07:19:35,506 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1627) no Hoare annotation was computed. [2022-12-14 07:19:35,507 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse39 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823))) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= 51 (select |#length| 5))) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse39 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (< 0 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) .cse32 .cse33 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse39) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse41 .cse42 .cse43 .cse44 .cse45 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse46 .cse47 .cse48))) [2022-12-14 07:19:35,507 INFO L899 garLoopResultBuilder]: For program point L1644(line 1644) no Hoare annotation was computed. [2022-12-14 07:19:35,507 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2022-12-14 07:19:35,507 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) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 07:19:35,508 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 07:19:35,508 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-14 07:19:35,508 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-14 07:19:35,508 INFO L899 garLoopResultBuilder]: For program point L1628(lines 1628 1648) no Hoare annotation was computed. [2022-12-14 07:19:35,508 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-12-14 07:19:35,509 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse22 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse55 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse22) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse56 (<= 0 .cse52)) (.cse53 (<= .cse68 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse66 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse22 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse60 (< 0 .cse67)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse65 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse57 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse22 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse61 (< 0 .cse68)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse36 (= .cse52 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse59 (<= .cse67 0)) (.cse64 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse44 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse22) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse52 0) .cse23 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse54 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse58 .cse59 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse64 .cse44 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse65 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse22) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 07:19:35,509 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-12-14 07:19:35,510 INFO L895 garLoopResultBuilder]: At program point L1653-4(lines 1653 1656) the Hoare annotation is: (let ((.cse66 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse52 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse23 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse57 (< 0 .cse67)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse55 (<= .cse68 0)) (.cse58 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse65 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse23 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse61 (< 0 .cse68)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse66 0)) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse64 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse53 (<= .cse67 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse44 (= ~globalArgc~0 0)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse23) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse60 (<= 0 .cse66)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse23) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse54 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse58 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse58 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse23) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= .cse66 0) .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse56 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51)))) [2022-12-14 07:19:35,510 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-12-14 07:19:35,511 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (let ((.cse54 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse61 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse62 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse61 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse64 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse65 (<= .cse67 0)) (.cse53 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse31 (< 0 .cse66)) (.cse57 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse61) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse60 (<= 0 .cse54)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (< 0 .cse67)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse56 (<= .cse66 0)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse54 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse43 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse44 (= ~globalArgc~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse61 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse54 0) .cse55 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse44 .cse58 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse61) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse61) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse64 .cse65 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-12-14 07:19:35,511 INFO L902 garLoopResultBuilder]: At program point L1678-1(line 1678) the Hoare annotation is: true [2022-12-14 07:19:35,511 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2022-12-14 07:19:35,511 INFO L899 garLoopResultBuilder]: For program point L1612-1(lines 1612 1626) no Hoare annotation was computed. [2022-12-14 07:19:35,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-14 07:19:35,511 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-12-14 07:19:35,512 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2022-12-14 07:19:35,514 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:35,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:19:35,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:19:35 BoogieIcfgContainer [2022-12-14 07:19:35,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:19:35,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:19:35,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:19:35,521 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:19:35,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:15:14" (3/4) ... [2022-12-14 07:19:35,523 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 07:19:35,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 07:19:35,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-12-14 07:19:35,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 07:19:35,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-12-14 07:19:35,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 07:19:35,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-14 07:19:35,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 07:19:35,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 07:19:35,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 07:19:35,558 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 07:19:35,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:19:35,559 INFO L158 Benchmark]: Toolchain (without parser) took 262218.78ms. Allocated memory was 188.7MB in the beginning and 329.3MB in the end (delta: 140.5MB). Free memory was 142.4MB in the beginning and 212.5MB in the end (delta: -70.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,559 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 94.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:19:35,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 932.04ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 77.4MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 188.7MB. Free memory was 77.4MB in the beginning and 74.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,560 INFO L158 Benchmark]: Boogie Preprocessor took 32.71ms. Allocated memory is still 188.7MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,560 INFO L158 Benchmark]: RCFGBuilder took 383.29ms. Allocated memory is still 188.7MB. Free memory was 72.1MB in the beginning and 139.0MB in the end (delta: -66.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,560 INFO L158 Benchmark]: TraceAbstraction took 260781.27ms. Allocated memory was 188.7MB in the beginning and 329.3MB in the end (delta: 140.5MB). Free memory was 138.0MB in the beginning and 216.7MB in the end (delta: -78.7MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,560 INFO L158 Benchmark]: Witness Printer took 37.57ms. Allocated memory is still 329.3MB. Free memory was 216.7MB in the beginning and 212.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 07:19:35,561 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 94.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 932.04ms. Allocated memory is still 188.7MB. Free memory was 142.4MB in the beginning and 77.4MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 188.7MB. Free memory was 77.4MB in the beginning and 74.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.71ms. Allocated memory is still 188.7MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.29ms. Allocated memory is still 188.7MB. Free memory was 72.1MB in the beginning and 139.0MB in the end (delta: -66.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 260781.27ms. Allocated memory was 188.7MB in the beginning and 329.3MB in the end (delta: 140.5MB). Free memory was 138.0MB in the beginning and 216.7MB in the end (delta: -78.7MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. * Witness Printer took 37.57ms. Allocated memory is still 329.3MB. Free memory was 216.7MB in the beginning and 212.5MB 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: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 260.7s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1397 SdHoareTripleChecker+Valid, 30.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 5354 SdHoareTripleChecker+Invalid, 28.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3684 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16081 IncrementalHoareTripleChecker+Invalid, 16587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 1670 mSDtfsCounter, 16081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2329 GetRequests, 1731 SyntacticMatches, 69 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8358 ImplicationChecksByTransitivity, 140.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=16, InterpolantAutomatonStates: 474, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 299 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 210 PreInvPairs, 321 NumberOfFragments, 18449 HoareAnnotationTreeSize, 210 FomulaSimplifications, 4242 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 84371 FormulaSimplificationTreeSizeReductionInter, 34.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2053 NumberOfCodeBlocks, 2053 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 3540 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4212 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 47 InterpolantComputations, 13 PerfectInterpolantSequences, 1243/1286 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 43.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 45, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 543, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 375, TOOLS_POST_TIME: 18.2s, TOOLS_POST_CALL_APPLICATIONS: 306, TOOLS_POST_CALL_TIME: 12.8s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 7.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 885, TOOLS_QUANTIFIERELIM_TIME: 38.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1284, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 270, DOMAIN_JOIN_TIME: 3.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 543, DOMAIN_ISBOTTOM_TIME: 1.2s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 204, CALL_SUMMARIZER_CACHE_MISSES: 36, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 18305, DAG_COMPRESSION_RETAINED_NODES: 1311, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1678]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 07:19:35,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c5618f9-6d35-4eba-9c89-752a3bd0eb9b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE