./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b3bbea65b78857147395889e1e5ad1fa76207cd1b4b81931c14c2d75d9d48b06 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:33:06,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:33:06,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:33:06,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:33:06,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:33:06,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:33:06,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:33:06,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:33:06,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:33:06,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:33:06,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:33:06,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:33:06,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:33:06,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:33:06,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:33:06,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:33:06,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:33:06,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:33:06,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:33:06,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:33:06,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:33:06,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:33:06,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:33:06,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:33:06,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:33:06,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:33:06,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:33:06,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:33:06,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:33:06,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:33:06,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:33:06,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:33:06,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:33:06,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:33:06,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:33:06,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:33:06,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:33:06,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:33:06,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:33:06,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:33:06,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:33:06,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 06:33:06,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:33:06,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:33:06,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:33:06,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:33:06,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:33:06,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:33:06,532 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:33:06,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:33:06,533 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:33:06,533 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:33:06,535 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:33:06,535 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:33:06,535 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:33:06,536 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:33:06,536 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:33:06,536 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:33:06,537 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:33:06,537 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:33:06,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:33:06,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:33:06,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:33:06,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:33:06,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:33:06,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:33:06,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:33:06,542 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 06:33:06,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:33:06,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:33:06,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:33:06,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:33:06,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:33:06,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:33:06,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:33:06,545 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:33:06,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:33:06,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:33:06,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:33:06,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:33:06,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:33:06,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:33:06,547 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_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3bbea65b78857147395889e1e5ad1fa76207cd1b4b81931c14c2d75d9d48b06 [2022-11-19 06:33:06,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:33:06,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:33:06,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:33:06,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:33:06,964 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:33:06,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-19 06:33:07,056 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/data/8bd9f0952/44d0ac4c11a34a64bef92bb6c920c61b/FLAG45eac23c8 [2022-11-19 06:33:08,043 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:33:08,043 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-19 06:33:08,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/data/8bd9f0952/44d0ac4c11a34a64bef92bb6c920c61b/FLAG45eac23c8 [2022-11-19 06:33:08,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/data/8bd9f0952/44d0ac4c11a34a64bef92bb6c920c61b [2022-11-19 06:33:08,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:33:08,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:33:08,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:33:08,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:33:08,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:33:08,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:08" (1/1) ... [2022-11-19 06:33:08,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776dcfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:08, skipping insertion in model container [2022-11-19 06:33:08,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:08" (1/1) ... [2022-11-19 06:33:08,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:33:08,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:33:08,731 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:33:09,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:33:09,372 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:33:09,414 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:33:09,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:33:09,668 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:33:09,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09 WrapperNode [2022-11-19 06:33:09,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:33:09,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:33:09,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:33:09,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:33:09,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,744 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2022-11-19 06:33:09,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:33:09,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:33:09,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:33:09,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:33:09,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,779 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:33:09,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:33:09,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:33:09,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:33:09,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (1/1) ... [2022-11-19 06:33:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:33:09,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:09,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:33:09,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:33:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 06:33:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 06:33:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 06:33:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 06:33:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 06:33:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-19 06:33:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-19 06:33:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:33:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 06:33:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:33:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:33:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:33:09,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:33:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-19 06:33:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-19 06:33:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 06:33:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:33:10,180 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:33:10,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:33:10,553 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:33:10,597 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:33:10,598 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:33:10,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:10 BoogieIcfgContainer [2022-11-19 06:33:10,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:33:10,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:33:10,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:33:10,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:33:10,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:33:08" (1/3) ... [2022-11-19 06:33:10,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e1df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:10, skipping insertion in model container [2022-11-19 06:33:10,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:09" (2/3) ... [2022-11-19 06:33:10,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e1df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:10, skipping insertion in model container [2022-11-19 06:33:10,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:10" (3/3) ... [2022-11-19 06:33:10,614 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_11_good.i [2022-11-19 06:33:10,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:33:10,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 06:33:10,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:33:10,746 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;@7685d872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:33:10,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 06:33:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:33:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:33:10,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:10,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:10,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1518909130, now seen corresponding path program 1 times [2022-11-19 06:33:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183136489] [2022-11-19 06:33:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:33:11,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:11,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183136489] [2022-11-19 06:33:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183136489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:33:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924175962] [2022-11-19 06:33:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:11,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:11,389 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:33:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:11,498 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-19 06:33:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-19 06:33:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:11,518 INFO L225 Difference]: With dead ends: 137 [2022-11-19 06:33:11,519 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 06:33:11,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:11,527 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:11,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:33:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 06:33:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 06:33:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:33:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-19 06:33:11,585 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-19 06:33:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:11,587 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-19 06:33:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:33:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-19 06:33:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:33:11,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:11,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:11,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:33:11,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1228629103, now seen corresponding path program 1 times [2022-11-19 06:33:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:11,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435917926] [2022-11-19 06:33:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:33:11,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:11,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435917926] [2022-11-19 06:33:11,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435917926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:11,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:11,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:33:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144888633] [2022-11-19 06:33:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:11,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:33:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:33:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:33:11,797 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:33:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:11,842 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-11-19 06:33:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:33:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2022-11-19 06:33:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:11,845 INFO L225 Difference]: With dead ends: 68 [2022-11-19 06:33:11,845 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 06:33:11,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:33:11,847 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:11,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 06:33:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-19 06:33:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:33:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-11-19 06:33:11,871 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-11-19 06:33:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:11,872 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-11-19 06:33:11,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:33:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-11-19 06:33:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:33:11,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:11,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:33:11,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -567203394, now seen corresponding path program 1 times [2022-11-19 06:33:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753755707] [2022-11-19 06:33:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:33:12,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:12,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753755707] [2022-11-19 06:33:12,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753755707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:12,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:12,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:33:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903099089] [2022-11-19 06:33:12,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:12,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:12,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:12,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:12,087 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:33:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:12,168 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-19 06:33:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:12,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-11-19 06:33:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:12,173 INFO L225 Difference]: With dead ends: 67 [2022-11-19 06:33:12,177 INFO L226 Difference]: Without dead ends: 66 [2022-11-19 06:33:12,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:33:12,181 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:12,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 174 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-19 06:33:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-19 06:33:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.368421052631579) internal successors, (52), 51 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:33:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-19 06:33:12,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 20 [2022-11-19 06:33:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:12,215 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-19 06:33:12,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:33:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-19 06:33:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 06:33:12,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:12,218 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:12,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:33:12,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1147666448, now seen corresponding path program 1 times [2022-11-19 06:33:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:12,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681551405] [2022-11-19 06:33:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 06:33:12,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:12,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681551405] [2022-11-19 06:33:12,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681551405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:12,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:12,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:33:12,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309588849] [2022-11-19 06:33:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:12,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:12,333 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:12,383 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2022-11-19 06:33:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-11-19 06:33:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:12,386 INFO L225 Difference]: With dead ends: 114 [2022-11-19 06:33:12,386 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:33:12,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:12,388 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:12,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:33:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:33:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 50 states have internal predecessors, (51), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:33:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-11-19 06:33:12,403 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 33 [2022-11-19 06:33:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:12,403 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-11-19 06:33:12,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-11-19 06:33:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 06:33:12,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:12,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:12,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:33:12,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1355647169, now seen corresponding path program 1 times [2022-11-19 06:33:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176365233] [2022-11-19 06:33:12,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:33:12,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:12,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176365233] [2022-11-19 06:33:12,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176365233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:12,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962204422] [2022-11-19 06:33:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:12,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:12,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:12,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:33:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:12,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:33:12,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:33:12,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:33:12,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962204422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:12,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:33:12,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:33:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268252532] [2022-11-19 06:33:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:12,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:12,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:12,906 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:12,993 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2022-11-19 06:33:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-19 06:33:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:12,996 INFO L225 Difference]: With dead ends: 106 [2022-11-19 06:33:12,998 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:33:12,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:13,001 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:13,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:33:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:33:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:33:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:33:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-19 06:33:13,031 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 34 [2022-11-19 06:33:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:13,032 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-19 06:33:13,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-11-19 06:33:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 06:33:13,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:13,036 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:13,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:13,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:13,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash -28075386, now seen corresponding path program 1 times [2022-11-19 06:33:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:13,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646263627] [2022-11-19 06:33:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 06:33:13,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:13,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646263627] [2022-11-19 06:33:13,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646263627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:13,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:13,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:33:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976576781] [2022-11-19 06:33:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:33:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:33:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:33:13,462 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:33:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:13,511 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-11-19 06:33:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:33:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 36 [2022-11-19 06:33:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:13,513 INFO L225 Difference]: With dead ends: 65 [2022-11-19 06:33:13,513 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 06:33:13,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:33:13,519 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:13,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 06:33:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-19 06:33:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:33:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-11-19 06:33:13,546 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 36 [2022-11-19 06:33:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:13,548 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-11-19 06:33:13,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:33:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-11-19 06:33:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:33:13,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:13,552 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:13,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:33:13,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:13,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -870336855, now seen corresponding path program 1 times [2022-11-19 06:33:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:13,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679740621] [2022-11-19 06:33:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 06:33:13,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679740621] [2022-11-19 06:33:13,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679740621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:13,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:13,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:33:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632127433] [2022-11-19 06:33:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:13,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:13,734 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:13,793 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-11-19 06:33:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:13,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-11-19 06:33:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:13,796 INFO L225 Difference]: With dead ends: 64 [2022-11-19 06:33:13,796 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:33:13,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:33:13,799 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:13,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:33:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:33:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 48 states have internal predecessors, (48), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:33:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-11-19 06:33:13,823 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2022-11-19 06:33:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:13,823 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-11-19 06:33:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:33:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-11-19 06:33:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 06:33:13,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:13,830 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:13,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:33:13,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -586911336, now seen corresponding path program 1 times [2022-11-19 06:33:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:13,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264838005] [2022-11-19 06:33:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:33:13,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:13,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264838005] [2022-11-19 06:33:13,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264838005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:13,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033184755] [2022-11-19 06:33:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:13,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:14,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:33:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:14,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:33:14,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:33:14,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:33:14,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033184755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:14,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:33:14,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:33:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40542869] [2022-11-19 06:33:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:14,223 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:33:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:14,282 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-11-19 06:33:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-11-19 06:33:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:14,286 INFO L225 Difference]: With dead ends: 94 [2022-11-19 06:33:14,286 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:33:14,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:14,292 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:14,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:33:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:33:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.236842105263158) internal successors, (47), 47 states have internal predecessors, (47), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:33:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-19 06:33:14,311 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 46 [2022-11-19 06:33:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:14,311 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-19 06:33:14,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:33:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2022-11-19 06:33:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 06:33:14,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:14,313 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:14,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:14,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:14,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1577974785, now seen corresponding path program 1 times [2022-11-19 06:33:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359474901] [2022-11-19 06:33:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 06:33:14,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359474901] [2022-11-19 06:33:14,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359474901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:14,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:14,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:33:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678101820] [2022-11-19 06:33:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:14,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:14,666 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:33:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:14,744 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2022-11-19 06:33:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 50 [2022-11-19 06:33:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:14,747 INFO L225 Difference]: With dead ends: 80 [2022-11-19 06:33:14,748 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 06:33:14,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:33:14,753 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:14,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:33:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 06:33:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-19 06:33:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 50 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:33:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-11-19 06:33:14,777 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 50 [2022-11-19 06:33:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:14,780 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-11-19 06:33:14,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:33:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-11-19 06:33:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 06:33:14,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:14,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:14,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:33:14,788 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1001422755, now seen corresponding path program 1 times [2022-11-19 06:33:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:14,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477889216] [2022-11-19 06:33:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-19 06:33:14,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:14,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477889216] [2022-11-19 06:33:14,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477889216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:14,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:14,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:33:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894783228] [2022-11-19 06:33:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:14,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:14,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:14,942 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:33:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:14,996 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-11-19 06:33:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2022-11-19 06:33:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:14,999 INFO L225 Difference]: With dead ends: 85 [2022-11-19 06:33:14,999 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 06:33:15,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:15,001 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:15,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 06:33:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-19 06:33:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 06:33:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-11-19 06:33:15,011 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 53 [2022-11-19 06:33:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:15,012 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-19 06:33:15,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:33:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-11-19 06:33:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 06:33:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:15,014 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:33:15,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash -402769081, now seen corresponding path program 1 times [2022-11-19 06:33:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976656454] [2022-11-19 06:33:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:15,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976656454] [2022-11-19 06:33:15,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976656454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897045562] [2022-11-19 06:33:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:15,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:15,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:15,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:15,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:33:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:15,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:33:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 06:33:15,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:33:15,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897045562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:15,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:33:15,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:33:15,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383440241] [2022-11-19 06:33:15,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:15,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:15,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:15,393 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:33:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:15,438 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-19 06:33:15,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:15,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-11-19 06:33:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:15,440 INFO L225 Difference]: With dead ends: 72 [2022-11-19 06:33:15,440 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 06:33:15,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:33:15,441 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:15,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:33:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 06:33:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-19 06:33:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.131578947368421) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 06:33:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-19 06:33:15,456 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 60 [2022-11-19 06:33:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:15,456 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-19 06:33:15,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:33:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-19 06:33:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 06:33:15,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:15,460 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:15,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:15,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 06:33:15,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2119652869, now seen corresponding path program 1 times [2022-11-19 06:33:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:15,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184367913] [2022-11-19 06:33:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:15,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184367913] [2022-11-19 06:33:15,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184367913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857265627] [2022-11-19 06:33:15,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:15,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:15,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:15,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:33:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:16,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:16,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:16,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:16,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857265627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:16,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1017095626] [2022-11-19 06:33:16,326 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-19 06:33:16,326 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:16,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:16,337 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:16,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:16,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:17,175 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:33:17,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:33:17,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:17,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:17,281 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:33:17,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:33:17,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:17,591 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:33:17,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:33:17,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:17,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:17,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:33:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,407 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:33:19,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:33:19,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,849 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:33:19,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:33:19,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:19,920 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:33:19,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:33:20,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:20,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:20,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:20,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:33:24,408 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:33:24,412 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:33:24,465 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:33:24,675 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 06:33:24,682 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:40,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1017095626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:40,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:40,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-19 06:33:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161421206] [2022-11-19 06:33:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:33:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:33:40,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2022-11-19 06:33:40,688 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:33:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:41,748 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-11-19 06:33:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:33:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-11-19 06:33:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:41,751 INFO L225 Difference]: With dead ends: 105 [2022-11-19 06:33:41,751 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 06:33:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=278, Invalid=1884, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:33:41,753 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:41,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 294 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 397 Unchecked, 0.5s Time] [2022-11-19 06:33:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 06:33:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-11-19 06:33:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 68 states have internal predecessors, (70), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:33:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-19 06:33:41,785 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 65 [2022-11-19 06:33:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:41,786 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-19 06:33:41,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:33:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-19 06:33:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 06:33:41,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:41,788 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] [2022-11-19 06:33:41,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:41,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:33:41,996 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:33:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1284729339, now seen corresponding path program 1 times [2022-11-19 06:33:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:41,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876724332] [2022-11-19 06:33:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:42,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:42,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876724332] [2022-11-19 06:33:42,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876724332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:42,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076431831] [2022-11-19 06:33:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:42,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:42,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:33:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:42,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:42,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:42,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:33:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076431831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:42,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [679375209] [2022-11-19 06:33:42,602 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-19 06:33:42,609 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:42,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:42,610 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:42,610 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:42,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:42,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,147 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:33:43,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:33:43,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:33:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:33:43,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:33:44,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:44,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:44,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,481 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:33:44,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:33:44,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:33:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:33:44,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,687 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:33:44,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-11-19 06:33:44,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:45,006 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:33:45,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-11-19 06:33:56,237 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:33:56,239 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 198 for LOIs [2022-11-19 06:33:56,407 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:33:56,410 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-19 06:33:56,426 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:34:23,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [679375209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:34:23,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:34:23,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [5, 5, 5] total 44 [2022-11-19 06:34:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545046455] [2022-11-19 06:34:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:34:23,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:34:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:34:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:34:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:34:23,958 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:34:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:34:24,423 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-11-19 06:34:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:34:24,424 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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 66 [2022-11-19 06:34:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:34:24,426 INFO L225 Difference]: With dead ends: 108 [2022-11-19 06:34:24,426 INFO L226 Difference]: Without dead ends: 86 [2022-11-19 06:34:24,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 147 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:34:24,429 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:34:24,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 678 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 493 Unchecked, 0.4s Time] [2022-11-19 06:34:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-19 06:34:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-11-19 06:34:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 56 states have internal predecessors, (57), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:34:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2022-11-19 06:34:24,455 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 66 [2022-11-19 06:34:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:34:24,455 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2022-11-19 06:34:24,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:34:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-11-19 06:34:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:34:24,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:34:24,457 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:34:24,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:34:24,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:24,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:34:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:34:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1886576016, now seen corresponding path program 1 times [2022-11-19 06:34:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:34:24,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894928063] [2022-11-19 06:34:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:24,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:34:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:24,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:34:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894928063] [2022-11-19 06:34:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894928063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:34:24,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32882510] [2022-11-19 06:34:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:34:24,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:34:24,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:34:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:25,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:34:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:34:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:25,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:34:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32882510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:34:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825930105] [2022-11-19 06:34:25,184 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:34:25,185 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:34:25,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:34:25,186 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:34:25,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:34:25,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:25,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:25,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:25,522 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:34:25,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:34:25,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:25,746 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:34:25,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:34:25,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:26,040 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:34:26,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:34:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:26,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:34:27,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,288 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:34:27,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:34:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,583 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:34:27,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:34:27,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,649 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:34:27,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:34:27,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:27,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:27,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:27,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:34:31,272 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:34:31,275 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 171 for LOIs [2022-11-19 06:34:31,423 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:34:31,580 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:34:31,704 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:34:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1825930105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:34:53,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:34:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:34:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475845416] [2022-11-19 06:34:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:34:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:34:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:34:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:34:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:34:53,452 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:34:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:34:53,776 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-11-19 06:34:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:34:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 06:34:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:34:53,779 INFO L225 Difference]: With dead ends: 110 [2022-11-19 06:34:53,779 INFO L226 Difference]: Without dead ends: 109 [2022-11-19 06:34:53,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:34:53,781 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:34:53,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 490 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 327 Unchecked, 0.3s Time] [2022-11-19 06:34:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-19 06:34:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-11-19 06:34:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:34:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2022-11-19 06:34:53,812 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 67 [2022-11-19 06:34:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:34:53,813 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2022-11-19 06:34:53,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:34:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-11-19 06:34:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:34:53,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:34:53,815 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:34:53,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-19 06:34:54,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 06:34:54,022 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:34:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:34:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1373439866, now seen corresponding path program 1 times [2022-11-19 06:34:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:34:54,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124555488] [2022-11-19 06:34:54,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:34:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:54,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:34:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124555488] [2022-11-19 06:34:54,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124555488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:34:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286528217] [2022-11-19 06:34:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:54,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:34:54,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:34:54,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:34:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:34:54,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:34:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:54,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:34:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:34:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286528217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:34:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [127290261] [2022-11-19 06:34:54,524 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:34:54,524 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:34:54,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:34:54,525 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:34:54,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:34:54,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:54,904 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:34:54,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:34:54,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:55,167 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:34:55,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:34:55,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:55,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:55,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:34:55,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:55,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:55,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:34:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,404 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:34:56,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:34:56,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,719 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:34:56,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:34:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:56,792 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:34:56,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:34:56,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:56,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:34:57,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:57,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:34:59,821 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:34:59,824 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 06:34:59,953 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:35:00,064 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:35:00,176 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:21,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [127290261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:21,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:21,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:35:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605659427] [2022-11-19 06:35:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:21,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:35:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:35:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:35:21,650 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:35:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:22,403 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2022-11-19 06:35:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 06:35:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 06:35:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:22,405 INFO L225 Difference]: With dead ends: 142 [2022-11-19 06:35:22,405 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 06:35:22,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 06:35:22,407 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:22,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 422 Unchecked, 0.3s Time] [2022-11-19 06:35:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 06:35:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2022-11-19 06:35:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 83 states have (on average 1.072289156626506) internal successors, (89), 88 states have internal predecessors, (89), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-19 06:35:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2022-11-19 06:35:22,459 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 67 [2022-11-19 06:35:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:22,459 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2022-11-19 06:35:22,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:35:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-11-19 06:35:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:35:22,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:22,461 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] [2022-11-19 06:35:22,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:22,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 06:35:22,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:35:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1645685488, now seen corresponding path program 1 times [2022-11-19 06:35:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:22,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953143219] [2022-11-19 06:35:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:22,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:22,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953143219] [2022-11-19 06:35:22,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953143219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:22,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672619927] [2022-11-19 06:35:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:22,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:22,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:35:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:23,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:35:23,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:23,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672619927] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:23,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1379697123] [2022-11-19 06:35:23,177 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:35:23,178 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:23,179 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:23,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:23,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:23,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:23,438 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:35:23,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:35:23,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:23,630 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:35:23,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:35:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:23,900 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:35:23,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:35:23,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:23,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:24,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:35:24,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:24,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:24,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,944 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:35:24,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:35:24,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:35:25,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:35:25,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,209 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:35:25,210 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-11-19 06:35:25,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:25,452 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:35:25,453 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-11-19 06:35:26,536 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:35:26,538 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 65 for LOIs [2022-11-19 06:35:26,553 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 06:35:26,622 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:35:26,734 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:37,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1379697123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:37,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:37,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:35:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566201490] [2022-11-19 06:35:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:35:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:35:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1943, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:35:37,568 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:35:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:39,472 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-19 06:35:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 06:35:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 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 68 [2022-11-19 06:35:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:39,474 INFO L225 Difference]: With dead ends: 141 [2022-11-19 06:35:39,474 INFO L226 Difference]: Without dead ends: 94 [2022-11-19 06:35:39,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=225, Invalid=2031, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 06:35:39,476 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:39,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 659 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 937 Invalid, 0 Unknown, 333 Unchecked, 1.4s Time] [2022-11-19 06:35:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-19 06:35:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-11-19 06:35:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 61 states have internal predecessors, (62), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:35:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-19 06:35:39,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 68 [2022-11-19 06:35:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:39,501 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-19 06:35:39,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:35:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-19 06:35:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:35:39,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:39,502 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] [2022-11-19 06:35:39,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:39,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:39,709 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:35:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 373037274, now seen corresponding path program 1 times [2022-11-19 06:35:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:39,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762917623] [2022-11-19 06:35:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:39,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762917623] [2022-11-19 06:35:39,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762917623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:39,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987077109] [2022-11-19 06:35:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:39,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:39,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:39,870 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:39,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:35:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:40,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:35:40,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:40,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:35:40,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987077109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:40,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [718693188] [2022-11-19 06:35:40,195 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:35:40,195 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:40,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:40,196 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:40,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:40,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:40,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:40,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:40,636 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:35:40,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:35:40,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:40,698 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:35:40,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:35:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:40,923 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:35:40,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:35:41,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:35:41,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:41,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:35:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,941 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:35:41,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:35:41,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:41,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:42,161 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:35:42,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:35:42,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:42,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:42,212 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:35:42,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:35:42,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:42,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:35:44,887 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:35:44,890 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 06:35:45,079 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:35:45,194 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:35:45,323 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:36:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [718693188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:05,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:36:05,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:36:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33257675] [2022-11-19 06:36:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:05,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:36:05,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:36:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:36:05,926 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:36:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:06,686 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-19 06:36:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 06:36:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 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 68 [2022-11-19 06:36:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:06,688 INFO L225 Difference]: With dead ends: 97 [2022-11-19 06:36:06,688 INFO L226 Difference]: Without dead ends: 73 [2022-11-19 06:36:06,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 155 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 06:36:06,690 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:06,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 342 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 607 Unchecked, 0.2s Time] [2022-11-19 06:36:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-19 06:36:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2022-11-19 06:36:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 06:36:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-19 06:36:06,714 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 68 [2022-11-19 06:36:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:06,715 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-19 06:36:06,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:36:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-19 06:36:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 06:36:06,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:06,716 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:36:06,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:36:06,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 06:36:06,923 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-11-19 06:36:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:06,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1737733467, now seen corresponding path program 1 times [2022-11-19 06:36:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:06,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964256608] [2022-11-19 06:36:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:36:07,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964256608] [2022-11-19 06:36:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964256608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:36:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120761608] [2022-11-19 06:36:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:36:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:36:07,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:36:07,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:36:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:36:07,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:36:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:36:07,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:36:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:36:07,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120761608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:36:07,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005316368] [2022-11-19 06:36:07,388 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 06:36:07,388 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:36:07,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:36:07,389 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:36:07,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:36:07,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,838 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:36:07,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:36:07,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:36:07,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:36:07,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:36:07,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:36:08,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:36:08,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:36:08,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:36:08,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,935 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:36:08,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:36:08,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,990 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:36:08,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:36:09,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,145 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:36:09,146 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-11-19 06:36:09,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:09,374 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:36:09,375 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-11-19 06:36:10,418 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:36:10,427 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 60 for LOIs [2022-11-19 06:36:10,438 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 06:36:10,523 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:36:10,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:36:20,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1005316368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:20,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:36:20,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [5, 5, 5] total 47 [2022-11-19 06:36:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269698026] [2022-11-19 06:36:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:20,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 06:36:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:20,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 06:36:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 06:36:20,669 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:36:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:22,357 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-19 06:36:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-19 06:36:22,357 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 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 69 [2022-11-19 06:36:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:22,358 INFO L225 Difference]: With dead ends: 73 [2022-11-19 06:36:22,358 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:36:22,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 154 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=230, Invalid=2122, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 06:36:22,360 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:22,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 109 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 772 Invalid, 0 Unknown, 127 Unchecked, 1.2s Time] [2022-11-19 06:36:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:36:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:36:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:36:22,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-19 06:36:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:22,362 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:36:22,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:36:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:36:22,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:36:22,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 06:36:22,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 06:36:22,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 06:36:22,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 06:36:22,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 06:36:22,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 06:36:22,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 06:36:22,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 06:36:22,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 06:36:22,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 06:36:22,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:36:49,824 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 06:36:49,824 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 06:36:49,824 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-19 06:36:49,824 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-19 06:36:49,824 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 06:36:49,825 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 06:36:49,825 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-19 06:36:49,826 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse27 (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)))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 06:36:49,826 INFO L899 garLoopResultBuilder]: For program point L1588-1(line 1588) no Hoare annotation was computed. [2022-11-19 06:36:49,826 INFO L899 garLoopResultBuilder]: For program point L1588-2(lines 1588 1601) no Hoare annotation was computed. [2022-11-19 06:36:49,827 INFO L895 garLoopResultBuilder]: At program point L1588-4(lines 1588 1601) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse39 (store ((as const (Array Int Int)) 0) 0 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.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 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 (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|) .cse39) (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)))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse39) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .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| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-19 06:36:49,827 INFO L895 garLoopResultBuilder]: At program point L1580(line 1580) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 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) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1566 1582) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1581) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L895 garLoopResultBuilder]: At program point L1622(line 1622) the Hoare annotation is: false [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2022-11-19 06:36:49,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 06:36:49,829 INFO L895 garLoopResultBuilder]: At program point L1664(line 1664) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,829 INFO L899 garLoopResultBuilder]: For program point L1664-1(line 1664) no Hoare annotation was computed. [2022-11-19 06:36:49,829 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1631-1(line 1631) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1598-1(lines 1592 1599) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-19 06:36:49,830 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-19 06:36:49,831 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-19 06:36:49,831 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1582) no Hoare annotation was computed. [2022-11-19 06:36:49,831 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1636) no Hoare annotation was computed. [2022-11-19 06:36:49,832 INFO L895 garLoopResultBuilder]: At program point L1641(line 1641) the Hoare annotation is: (let ((.cse17 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse33 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (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 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse34 (= ~globalArgv~0.base 0)) (.cse35 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse36 (= (select (select |#memory_int| 6) 0) 0)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse52 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse10 .cse12 .cse13 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse53 .cse22 .cse24 .cse29 .cse34 .cse40 .cse41 .cse42 .cse43 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse54 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse11) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse11 (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 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse54 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 06:36:49,833 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse28 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse28 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (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 (= .cse28 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-19 06:36:49,833 INFO L899 garLoopResultBuilder]: For program point L1641-1(line 1641) no Hoare annotation was computed. [2022-11-19 06:36:49,834 INFO L895 garLoopResultBuilder]: At program point L1641-4(lines 1641 1644) the Hoare annotation is: (let ((.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse43 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse43) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse52 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse10 .cse11 .cse12 .cse53 .cse16 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse54 .cse20 .cse26 .cse31 .cse37 .cse38 .cse40 .cse41 .cse42 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse43) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 06:36:49,834 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-19 06:36:49,835 INFO L895 garLoopResultBuilder]: At program point L1633(line 1633) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.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|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (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 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse3 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse11 .cse12 .cse13 .cse52 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse22 .cse23 .cse29 .cse33 .cse39 .cse40 .cse42 .cse43 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse14) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse15 .cse16 .cse17 .cse52 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse53 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse53 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse14) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 06:36:49,835 INFO L902 garLoopResultBuilder]: At program point L1666-1(line 1666) the Hoare annotation is: true [2022-11-19 06:36:49,835 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1599) no Hoare annotation was computed. [2022-11-19 06:36:49,835 INFO L902 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: true [2022-11-19 06:36:49,835 INFO L899 garLoopResultBuilder]: For program point L1584(lines 1584 1615) no Hoare annotation was computed. [2022-11-19 06:36:49,836 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,836 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-19 06:36:49,836 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-19 06:36:49,836 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,837 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-19 06:36:49,837 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-19 06:36:49,837 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 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) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,837 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point L1602-1(lines 1602 1614) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1631) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1606) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point L1628(line 1628) no Hoare annotation was computed. [2022-11-19 06:36:49,838 INFO L899 garLoopResultBuilder]: For program point L1628-1(lines 1628 1635) no Hoare annotation was computed. [2022-11-19 06:36:49,839 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:36:49,839 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:36:49,840 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse51 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.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|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.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|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (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 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse14) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse15 .cse16 .cse17 .cse51 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse1 .cse3 .cse5 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse12 .cse13 .cse51 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse22 .cse23 .cse32 .cse38 .cse39 .cse41 .cse42 .cse45 (<= 0 |#StackHeapBarrier|) .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse14) (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)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 06:36:49,840 INFO L899 garLoopResultBuilder]: For program point L1620-1(line 1620) no Hoare annotation was computed. [2022-11-19 06:36:49,840 INFO L899 garLoopResultBuilder]: For program point L1620-2(lines 1620 1627) no Hoare annotation was computed. [2022-11-19 06:36:49,841 INFO L895 garLoopResultBuilder]: At program point L1620-3(lines 1620 1627) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse7 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse5 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse17 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse18 (= (select |#length| 6) 1)) (.cse19 (= 1 (select |#valid| 5))) (.cse20 (= (select (select |#memory_int| 2) 0) 0)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse22 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse23 (= (select |#valid| 9) 1)) (.cse24 (= (select |#valid| 11) 1)) (.cse25 (= (select (select |#memory_int| 1) 0) 0)) (.cse3 (= ~globalArgv~0.offset 0)) (.cse4 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse27 (= (select |#valid| 3) 1)) (.cse28 (= 21 (select |#length| 4))) (.cse29 (= (select |#valid| 7) 1)) (.cse6 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= (select |#length| 10) 18)) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse8 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse33 (= 16 (select |#length| 7))) (.cse34 (= (select |#length| 5) 54)) (.cse35 (= (select |#valid| 4) 1)) (.cse36 (= 16 (select |#length| 3))) (.cse37 (= (select |#length| 2) 1)) (.cse38 (= (select |#valid| 1) 1)) (.cse39 (= 16 (select |#length| 11))) (.cse40 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse9 (= ~globalArgv~0.base 0)) (.cse41 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse42 (= (select (select |#memory_int| 6) 0) 0)) (.cse43 (= (select |#valid| 0) 0)) (.cse44 (= (select |#length| 1) 1)) (.cse45 (= (select |#valid| 2) 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (= ~globalFalse~0 0)) (.cse46 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse12 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse13 (= ~globalArgc~0 0)) (.cse26 (store ((as const (Array Int Int)) 0) 0 0)) (.cse47 (= (select |#valid| 6) 1)) (.cse48 (= (select |#length| 8) 54)) (.cse14 (= 5 ~globalFive~0)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= (select |#valid| 8) 1)) (.cse51 (< 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0)) (.cse16 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |#StackHeapBarrier|) .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse26 (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)))) .cse27 .cse28 .cse29 .cse6 .cse30 .cse31 .cse32 .cse7 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 .cse10 .cse11 .cse46 .cse12 .cse13 .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse26) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse4 .cse27 .cse28 .cse29 .cse5 .cse6 .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse10 .cse11 .cse12 .cse13 .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 .cse27 .cse28 .cse29 .cse6 .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 .cse10 .cse11 .cse46 .cse12 .cse13 (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|) .cse26) (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)))) .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16))) [2022-11-19 06:36:49,841 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-19 06:36:49,841 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse11) (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)))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-19 06:36:49,841 INFO L899 garLoopResultBuilder]: For program point L1645-1(lines 1645 1652) no Hoare annotation was computed. [2022-11-19 06:36:49,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1648) no Hoare annotation was computed. [2022-11-19 06:36:49,842 INFO L899 garLoopResultBuilder]: For program point L1637(lines 1637 1653) no Hoare annotation was computed. [2022-11-19 06:36:49,842 INFO L899 garLoopResultBuilder]: For program point L1604(lines 1604 1613) no Hoare annotation was computed. [2022-11-19 06:36:49,842 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-19 06:36:49,842 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-19 06:36:49,846 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:36:49,848 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:36:49,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:36:49 BoogieIcfgContainer [2022-11-19 06:36:49,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:36:49,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:36:49,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:36:49,858 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:36:49,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:10" (3/4) ... [2022-11-19 06:36:49,861 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:36:49,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 06:36:49,867 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-19 06:36:49,868 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 06:36:49,868 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-19 06:36:49,874 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 06:36:49,874 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-19 06:36:49,875 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 06:36:49,875 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:36:49,876 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:36:49,927 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:36:49,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:36:49,928 INFO L158 Benchmark]: Toolchain (without parser) took 221795.53ms. Allocated memory was 113.2MB in the beginning and 450.9MB in the end (delta: 337.6MB). Free memory was 80.1MB in the beginning and 204.4MB in the end (delta: -124.4MB). Peak memory consumption was 214.0MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,928 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 113.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:36:49,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1534.20ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 80.1MB in the beginning and 112.0MB in the end (delta: -32.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 108.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,929 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,930 INFO L158 Benchmark]: RCFGBuilder took 815.86ms. Allocated memory is still 144.7MB. Free memory was 106.4MB in the beginning and 86.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,930 INFO L158 Benchmark]: TraceAbstraction took 219252.54ms. Allocated memory was 144.7MB in the beginning and 450.9MB in the end (delta: 306.2MB). Free memory was 85.4MB in the beginning and 209.7MB in the end (delta: -124.3MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,930 INFO L158 Benchmark]: Witness Printer took 70.28ms. Allocated memory is still 450.9MB. Free memory was 209.7MB in the beginning and 204.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 06:36:49,932 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.39ms. Allocated memory is still 113.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1534.20ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 80.1MB in the beginning and 112.0MB in the end (delta: -32.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 108.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 815.86ms. Allocated memory is still 144.7MB. Free memory was 106.4MB in the beginning and 86.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 219252.54ms. Allocated memory was 144.7MB in the beginning and 450.9MB in the end (delta: 306.2MB). Free memory was 85.4MB in the beginning and 209.7MB in the end (delta: -124.3MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. * Witness Printer took 70.28ms. Allocated memory is still 450.9MB. Free memory was 209.7MB in the beginning and 204.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 219.1s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 27.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 5257 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2706 IncrementalHoareTripleChecker+Unchecked, 4032 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2564 IncrementalHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1225 mSDtfsCounter, 2564 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1614 GetRequests, 1214 SyntacticMatches, 53 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5279 ImplicationChecksByTransitivity, 131.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=15, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 111 PreInvPairs, 148 NumberOfFragments, 8631 HoareAnnotationTreeSize, 111 FomulaSimplifications, 838 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 25 FomulaSimplificationsInter, 34622 FormulaSimplificationTreeSizeReductionInter, 25.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1485 NumberOfCodeBlocks, 1485 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 2349 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2883 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 943/968 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: 46.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 35, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 414, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 274, TOOLS_POST_TIME: 20.5s, TOOLS_POST_CALL_APPLICATIONS: 252, TOOLS_POST_CALL_TIME: 11.3s, TOOLS_POST_RETURN_APPLICATIONS: 168, TOOLS_POST_RETURN_TIME: 8.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 694, TOOLS_QUANTIFIERELIM_TIME: 39.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 982, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 224, DOMAIN_JOIN_TIME: 4.4s, 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: 414, 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: 168, CALL_SUMMARIZER_CACHE_MISSES: 28, 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: 13788, DAG_COMPRESSION_RETAINED_NODES: 1003, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1666]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-19 06:36:49,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd66a776-c6f6-462d-b675-dfb659fdc865/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE