./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba --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 5e238f396c7bb9cfc8f8b3b0d182f18e9116ee923d63a2bc676d0215852d3ef8 --- 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-b5237d8 [2022-11-22 00:34:10,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:34:10,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:34:10,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:34:10,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:34:10,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:34:10,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:34:10,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:34:10,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:34:10,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:34:10,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:34:10,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:34:10,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:34:10,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:34:10,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:34:10,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:34:10,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:34:10,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:34:10,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:34:10,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:34:10,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:34:10,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:34:10,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:34:10,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:34:10,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:34:10,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:34:10,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:34:10,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:34:10,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:34:10,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:34:10,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:34:10,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:34:10,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:34:10,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:34:10,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:34:10,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:34:10,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:34:10,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:34:10,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:34:10,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:34:10,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:34:10,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 00:34:10,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:34:10,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:34:10,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:34:10,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:34:10,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:34:10,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:34:10,590 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:34:10,590 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:34:10,590 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:34:10,590 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:34:10,591 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:34:10,591 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:34:10,591 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:34:10,591 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:34:10,591 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:34:10,592 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:34:10,592 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:34:10,592 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:34:10,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:34:10,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:34:10,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:34:10,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:34:10,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:34:10,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:34:10,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:34:10,594 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:34:10,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:34:10,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:34:10,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:34:10,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:34:10,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:34:10,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:10,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:34:10,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:34:10,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:34:10,597 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_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/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_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba 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 -> 5e238f396c7bb9cfc8f8b3b0d182f18e9116ee923d63a2bc676d0215852d3ef8 [2022-11-22 00:34:10,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:34:10,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:34:10,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:34:10,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:34:10,917 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:34:10,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_good.i [2022-11-22 00:34:13,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:34:14,271 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:34:14,272 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_good.i [2022-11-22 00:34:14,297 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/data/61b9d98d4/42c58dfa9f70484a9c884f57a2fb58c3/FLAG338624be5 [2022-11-22 00:34:14,468 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/data/61b9d98d4/42c58dfa9f70484a9c884f57a2fb58c3 [2022-11-22 00:34:14,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:34:14,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:34:14,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:14,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:34:14,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:34:14,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:14" (1/1) ... [2022-11-22 00:34:14,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e1d42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:14, skipping insertion in model container [2022-11-22 00:34:14,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:14" (1/1) ... [2022-11-22 00:34:14,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:34:14,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:34:14,947 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:34:15,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:15,534 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:34:15,552 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 00:34:15,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:15,757 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:34:15,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15 WrapperNode [2022-11-22 00:34:15,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:15,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:15,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:34:15,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:34:15,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,853 INFO L138 Inliner]: procedures = 503, calls = 77, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-22 00:34:15,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:15,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:34:15,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:34:15,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:34:15,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:34:15,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:34:15,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:34:15,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:34:15,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (1/1) ... [2022-11-22 00:34:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:15,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:34:15,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:34:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 00:34:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 00:34:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 00:34:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 00:34:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-22 00:34:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-22 00:34:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:34:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:34:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:34:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-22 00:34:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-22 00:34:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 00:34:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:34:16,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:34:16,191 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:34:16,580 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:34:16,687 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:34:16,687 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:34:16,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:16 BoogieIcfgContainer [2022-11-22 00:34:16,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:34:16,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:34:16,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:34:16,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:34:16,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:14" (1/3) ... [2022-11-22 00:34:16,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6310ad4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:16, skipping insertion in model container [2022-11-22 00:34:16,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:15" (2/3) ... [2022-11-22 00:34:16,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6310ad4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:16, skipping insertion in model container [2022-11-22 00:34:16,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:16" (3/3) ... [2022-11-22 00:34:16,698 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_11_good.i [2022-11-22 00:34:16,727 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:34:16,728 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 00:34:16,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:34:16,779 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;@7fa43bcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:34:16,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 00:34:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 00:34:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:34:16,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:16,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:16,792 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-22 00:34:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -760081410, now seen corresponding path program 1 times [2022-11-22 00:34:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463336509] [2022-11-22 00:34:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:17,136 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-22 00:34:17,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:17,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463336509] [2022-11-22 00:34:17,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463336509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:17,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:17,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515094792] [2022-11-22 00:34:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:17,188 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 00:34:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:17,293 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2022-11-22 00:34:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2022-11-22 00:34:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:17,305 INFO L225 Difference]: With dead ends: 106 [2022-11-22 00:34:17,305 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 00:34:17,311 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-22 00:34:17,319 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:17,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 00:34:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2022-11-22 00:34:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.375) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 00:34:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-22 00:34:17,386 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 16 [2022-11-22 00:34:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:17,387 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-22 00:34:17,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-22 00:34:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-22 00:34:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:34:17,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:17,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:34:17,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2087687154, now seen corresponding path program 1 times [2022-11-22 00:34:17,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:17,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409585465] [2022-11-22 00:34:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:17,921 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-22 00:34:17,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409585465] [2022-11-22 00:34:17,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409585465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:17,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:17,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:34:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955911122] [2022-11-22 00:34:17,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:17,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:34:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:34:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:17,927 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:34:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:18,028 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-22 00:34:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:34:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-22 00:34:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:18,031 INFO L225 Difference]: With dead ends: 59 [2022-11-22 00:34:18,031 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 00:34:18,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:18,037 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:18,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 00:34:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-22 00:34:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.34375) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 00:34:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-22 00:34:18,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 17 [2022-11-22 00:34:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:18,061 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-22 00:34:18,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 00:34:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-22 00:34:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 00:34:18,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:18,068 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:18,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:34:18,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash 546335334, now seen corresponding path program 1 times [2022-11-22 00:34:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:18,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561274570] [2022-11-22 00:34:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:18,237 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-22 00:34:18,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561274570] [2022-11-22 00:34:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561274570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:18,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:18,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:34:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446703748] [2022-11-22 00:34:18,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:34:18,241 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:34:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:18,308 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-11-22 00:34:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2022-11-22 00:34:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:18,313 INFO L225 Difference]: With dead ends: 102 [2022-11-22 00:34:18,313 INFO L226 Difference]: Without dead ends: 57 [2022-11-22 00:34:18,314 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-22 00:34:18,318 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:18,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-22 00:34:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-22 00:34:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-11-22 00:34:18,339 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 29 [2022-11-22 00:34:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:18,340 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-11-22 00:34:18,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 00:34:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-11-22 00:34:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 00:34:18,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:18,343 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:18,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:34:18,344 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-22 00:34:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash 492286548, now seen corresponding path program 1 times [2022-11-22 00:34:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535177100] [2022-11-22 00:34:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:18,474 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-22 00:34:18,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:18,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535177100] [2022-11-22 00:34:18,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535177100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:18,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478198379] [2022-11-22 00:34:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:18,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:18,480 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 00:34:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:18,549 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-11-22 00:34:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 30 [2022-11-22 00:34:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:18,552 INFO L225 Difference]: With dead ends: 80 [2022-11-22 00:34:18,552 INFO L226 Difference]: Without dead ends: 79 [2022-11-22 00:34:18,553 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-22 00:34:18,561 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:18,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-22 00:34:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-11-22 00:34:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-11-22 00:34:18,578 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2022-11-22 00:34:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:18,579 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-11-22 00:34:18,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 00:34:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-11-22 00:34:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 00:34:18,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:18,581 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:18,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:34:18,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1918986087, now seen corresponding path program 1 times [2022-11-22 00:34:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829916080] [2022-11-22 00:34:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:18,862 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-22 00:34:18,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:18,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829916080] [2022-11-22 00:34:18,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829916080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:18,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:34:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302872119] [2022-11-22 00:34:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:18,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:34:18,866 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:34:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:18,940 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-11-22 00:34:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-11-22 00:34:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:18,944 INFO L225 Difference]: With dead ends: 56 [2022-11-22 00:34:18,944 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 00:34:18,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:34:18,952 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:18,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 00:34:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-22 00:34:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 40 states have internal predecessors, (40), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-22 00:34:18,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 31 [2022-11-22 00:34:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:18,968 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-22 00:34:18,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 00:34:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-22 00:34:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 00:34:18,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:18,970 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:18,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:34:18,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1350336792, now seen corresponding path program 1 times [2022-11-22 00:34:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:18,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436738714] [2022-11-22 00:34:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,083 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-22 00:34:19,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436738714] [2022-11-22 00:34:19,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436738714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639978892] [2022-11-22 00:34:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:19,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:19,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:34:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:34:19,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:34:19,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:19,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639978892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:19,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:19,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 00:34:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096093956] [2022-11-22 00:34:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:19,337 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 00:34:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:19,381 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-11-22 00:34:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:19,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 40 [2022-11-22 00:34:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:19,384 INFO L225 Difference]: With dead ends: 55 [2022-11-22 00:34:19,384 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 00:34:19,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:19,387 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:19,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 00:34:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 00:34:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 39 states have internal predecessors, (39), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-22 00:34:19,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 40 [2022-11-22 00:34:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:19,407 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-22 00:34:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 00:34:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-22 00:34:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 00:34:19,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:19,408 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:19,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 00:34:19,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 00:34:19,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1089232544, now seen corresponding path program 1 times [2022-11-22 00:34:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021582202] [2022-11-22 00:34:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,713 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-22 00:34:19,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:19,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021582202] [2022-11-22 00:34:19,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021582202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:19,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832051553] [2022-11-22 00:34:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:19,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:19,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:19,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:19,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:34:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:19,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:34:19,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 00:34:19,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:19,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832051553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:19,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 00:34:19,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309845091] [2022-11-22 00:34:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:19,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:19,866 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 00:34:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:19,910 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-11-22 00:34:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2022-11-22 00:34:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:19,912 INFO L225 Difference]: With dead ends: 71 [2022-11-22 00:34:19,912 INFO L226 Difference]: Without dead ends: 70 [2022-11-22 00:34:19,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:19,913 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:19,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-22 00:34:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-11-22 00:34:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 00:34:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-22 00:34:19,922 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 41 [2022-11-22 00:34:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:19,922 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-22 00:34:19,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 00:34:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-22 00:34:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 00:34:19,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:19,924 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:19,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 00:34:20,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-22 00:34:20,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1121653809, now seen corresponding path program 1 times [2022-11-22 00:34:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:20,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595880726] [2022-11-22 00:34:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 00:34:20,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595880726] [2022-11-22 00:34:20,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595880726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364463456] [2022-11-22 00:34:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:20,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:20,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:20,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:34:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:20,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 00:34:20,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:20,449 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-22 00:34:20,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:20,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364463456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:20,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:20,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 00:34:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841746479] [2022-11-22 00:34:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:20,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:20,451 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 00:34:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:20,497 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-22 00:34:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 44 [2022-11-22 00:34:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:20,500 INFO L225 Difference]: With dead ends: 59 [2022-11-22 00:34:20,500 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 00:34:20,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:20,502 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:20,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 00:34:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-11-22 00:34:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 38 states have internal predecessors, (38), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-22 00:34:20,510 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 44 [2022-11-22 00:34:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:20,511 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-22 00:34:20,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 00:34:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-22 00:34:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 00:34:20,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:20,516 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:20,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:20,717 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2066208952, now seen corresponding path program 1 times [2022-11-22 00:34:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:20,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654658287] [2022-11-22 00:34:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 00:34:20,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:20,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654658287] [2022-11-22 00:34:20,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654658287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:20,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849241493] [2022-11-22 00:34:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:20,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:20,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:34:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:20,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:34:20,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 00:34:21,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:21,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849241493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:21,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:21,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 00:34:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020515250] [2022-11-22 00:34:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:21,028 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 00:34:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:21,077 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-22 00:34:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 50 [2022-11-22 00:34:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:21,079 INFO L225 Difference]: With dead ends: 82 [2022-11-22 00:34:21,079 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 00:34:21,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:21,082 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:21,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 00:34:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 00:34:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-22 00:34:21,092 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-11-22 00:34:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:21,092 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-22 00:34:21,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 00:34:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-22 00:34:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-22 00:34:21,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:21,099 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:21,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:21,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:21,306 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:34:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash 831465148, now seen corresponding path program 1 times [2022-11-22 00:34:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991167977] [2022-11-22 00:34:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:21,411 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-22 00:34:21,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991167977] [2022-11-22 00:34:21,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991167977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828791868] [2022-11-22 00:34:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:21,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:21,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:21,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:34:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:21,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:34:21,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:21,595 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-22 00:34:21,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:21,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828791868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:21,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:21,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 00:34:21,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077282381] [2022-11-22 00:34:21,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:21,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:21,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:21,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:21,598 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 00:34:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:21,639 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-11-22 00:34:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2022-11-22 00:34:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:21,640 INFO L225 Difference]: With dead ends: 65 [2022-11-22 00:34:21,640 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 00:34:21,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:21,641 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:21,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 00:34:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 00:34:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 00:34:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-22 00:34:21,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 54 [2022-11-22 00:34:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:21,649 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-22 00:34:21,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 00:34:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-22 00:34:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-22 00:34:21,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:21,651 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:21,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 00:34:21,856 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-22 00:34:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash -863156996, now seen corresponding path program 1 times [2022-11-22 00:34:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:21,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440226370] [2022-11-22 00:34:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:22,008 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-22 00:34:22,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:22,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440226370] [2022-11-22 00:34:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440226370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:22,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044505349] [2022-11-22 00:34:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:22,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:22,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:22,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:34:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:22,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:34:22,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:22,202 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-22 00:34:22,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:22,288 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-22 00:34:22,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044505349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:22,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1981711589] [2022-11-22 00:34:22,339 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2022-11-22 00:34:22,340 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:34:22,343 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:34:22,348 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:34:22,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:34:27,310 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-22 00:34:27,327 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 31 for LOIs [2022-11-22 00:34:27,329 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-22 00:34:27,346 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 35 for LOIs [2022-11-22 00:34:27,350 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:34:39,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1981711589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:39,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:39,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [4, 4, 4] total 36 [2022-11-22 00:34:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489294420] [2022-11-22 00:34:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:39,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:34:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:39,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:34:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 00:34:39,207 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:34:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:49,292 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-11-22 00:34:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 00:34:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 59 [2022-11-22 00:34:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:49,305 INFO L225 Difference]: With dead ends: 128 [2022-11-22 00:34:49,306 INFO L226 Difference]: Without dead ends: 84 [2022-11-22 00:34:49,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 00:34:49,308 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 125 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:49,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 339 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-22 00:34:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-22 00:34:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-11-22 00:34:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 00:34:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-22 00:34:49,338 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 59 [2022-11-22 00:34:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:49,340 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-22 00:34:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:34:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-22 00:34:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-22 00:34:49,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:49,344 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:49,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:49,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:49,551 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-22 00:34:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1443870672, now seen corresponding path program 1 times [2022-11-22 00:34:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740162634] [2022-11-22 00:34:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:49,716 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-22 00:34:49,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740162634] [2022-11-22 00:34:49,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740162634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:49,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558801937] [2022-11-22 00:34:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:49,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:49,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:34:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:49,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:34:49,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:49,898 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-22 00:34:49,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:49,977 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-22 00:34:49,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558801937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:49,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217433863] [2022-11-22 00:34:49,980 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-22 00:34:49,980 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:34:49,981 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:34:49,981 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:34:49,981 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:34:53,473 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-22 00:34:53,489 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 66 for LOIs [2022-11-22 00:34:53,506 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-22 00:34:53,522 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-22 00:34:53,558 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:35:02,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1217433863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:02,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:35:02,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 37 [2022-11-22 00:35:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309530154] [2022-11-22 00:35:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:02,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:35:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:35:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 00:35:02,647 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:35:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:14,075 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-11-22 00:35:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-22 00:35:14,075 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 61 [2022-11-22 00:35:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:14,076 INFO L225 Difference]: With dead ends: 108 [2022-11-22 00:35:14,076 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 00:35:14,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 00:35:14,078 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 103 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:14,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 308 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-22 00:35:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 00:35:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 00:35:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-22 00:35:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-11-22 00:35:14,101 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2022-11-22 00:35:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:14,101 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-11-22 00:35:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:35:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-11-22 00:35:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-22 00:35:14,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:14,103 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:14,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 00:35:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 00:35:14,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 00:35:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 168025968, now seen corresponding path program 1 times [2022-11-22 00:35:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:14,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866821767] [2022-11-22 00:35:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:14,453 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-22 00:35:14,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:14,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866821767] [2022-11-22 00:35:14,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866821767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:35:14,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971520324] [2022-11-22 00:35:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:14,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:35:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:35:14,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:35:14,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:35:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:14,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:35:14,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:35:14,622 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-22 00:35:14,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:35:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-22 00:35:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971520324] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:35:14,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1693088841] [2022-11-22 00:35:14,708 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-22 00:35:14,708 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:35:14,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:35:14,710 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:35:14,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:35:18,447 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-22 00:35:18,464 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-22 00:35:18,466 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-22 00:35:18,482 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-22 00:35:18,515 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:36:12,708 WARN L233 SmtUtils]: Spent 49.90s on a formula simplification. DAG size of input: 207 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:36:47,513 WARN L233 SmtUtils]: Spent 29.65s on a formula simplification. DAG size of input: 223 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:36:52,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1693088841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:52,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:36:52,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 37 [2022-11-22 00:36:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389843573] [2022-11-22 00:36:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:52,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:36:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:52,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:36:52,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 00:36:52,315 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:37:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:37:02,409 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-11-22 00:37:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-22 00:37:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 61 [2022-11-22 00:37:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:37:02,411 INFO L225 Difference]: With dead ends: 99 [2022-11-22 00:37:02,411 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 00:37:02,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 101.6s TimeCoverageRelationStatistics Valid=349, Invalid=2003, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 00:37:02,413 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:37:02,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-22 00:37:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 00:37:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-22 00:37:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-22 00:37:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-22 00:37:02,437 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 61 [2022-11-22 00:37:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:37:02,438 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-22 00:37:02,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:37:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-22 00:37:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-22 00:37:02,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:37:02,439 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:37:02,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:37:02,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:37:02,644 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-22 00:37:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:37:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 273253700, now seen corresponding path program 1 times [2022-11-22 00:37:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:37:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664404492] [2022-11-22 00:37:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:37:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:37:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:37:02,795 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-22 00:37:02,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:37:02,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664404492] [2022-11-22 00:37:02,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664404492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:37:02,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712307016] [2022-11-22 00:37:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:37:02,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:37:02,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:37:02,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:37:02,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:37:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:37:02,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:37:02,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:37:02,965 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-22 00:37:02,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:37:03,045 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-22 00:37:03,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712307016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:37:03,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650235653] [2022-11-22 00:37:03,048 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-22 00:37:03,048 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:37:03,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:37:03,049 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:37:03,049 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:37:06,634 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-22 00:37:06,648 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-22 00:37:06,651 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-22 00:37:06,667 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 77 for LOIs [2022-11-22 00:37:06,675 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:37:23,810 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 299 DAG size of output: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:37:25,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1650235653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:37:25,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:37:25,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 38 [2022-11-22 00:37:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418795968] [2022-11-22 00:37:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:37:25,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 00:37:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:37:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 00:37:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2022-11-22 00:37:25,808 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:37:28,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:30,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:41,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:52,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:53,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:57,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:02,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:05,037 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-22 00:38:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 00:38:05,037 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 63 [2022-11-22 00:38:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:05,038 INFO L225 Difference]: With dead ends: 73 [2022-11-22 00:38:05,038 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:38:05,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=390, Invalid=2259, Unknown=3, NotChecked=0, Total=2652 [2022-11-22 00:38:05,041 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 82 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 45 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:05,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 47 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 676 Invalid, 6 Unknown, 0 Unchecked, 17.7s Time] [2022-11-22 00:38:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:38:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:38:05,042 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-22 00:38:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:38:05,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-11-22 00:38:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:05,043 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:38:05,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 00:38:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:38:05,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:38:05,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 00:38:05,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 00:38:05,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 00:38:05,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 00:38:05,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 00:38:05,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 00:38:05,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 00:38:05,047 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 00:38:05,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:05,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:05,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:38:17,678 WARN L233 SmtUtils]: Spent 11.67s on a formula simplification. DAG size of input: 470 DAG size of output: 312 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:38:28,830 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 476 DAG size of output: 319 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:38:44,936 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 466 DAG size of output: 310 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:38:54,311 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 476 DAG size of output: 318 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:09,142 WARN L233 SmtUtils]: Spent 14.74s on a formula simplification. DAG size of input: 500 DAG size of output: 150 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:20,517 WARN L233 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 473 DAG size of output: 315 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:31,237 WARN L233 SmtUtils]: Spent 10.68s on a formula simplification. DAG size of input: 490 DAG size of output: 266 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:39:34,412 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 00:39:34,412 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 00:39:34,412 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-22 00:39:34,412 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-22 00:39:34,413 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 00:39:34,413 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 00:39:34,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-22 00:39:34,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-22 00:39:34,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-22 00:39:34,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1622-1(lines 1622 1628) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1556(line 1556) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1556-1(lines 1556 1571) no Hoare annotation was computed. [2022-11-22 00:39:34,414 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1629) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point L1581(line 1581) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point L1581-1(lines 1581 1592) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point L1573(lines 1573 1593) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point L1606-1(lines 1606 1612) no Hoare annotation was computed. [2022-11-22 00:39:34,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-22 00:39:34,417 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse24 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse48 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse55 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse68 (mod (let ((.cse70 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse72 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse69 (= .cse72 0)) (.cse71 (= .cse70 0)) (.cse73 (= .cse70 .cse72))) (ite (= (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse68 2147483647) .cse68 (+ .cse68 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647)))) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse18 (= (select |#length| 3) 54)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse62 (mod (let ((.cse64 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse66 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse63 (= .cse66 0)) (.cse65 (= .cse64 0)) (.cse67 (= .cse64 .cse66))) (ite (= (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse62 2147483647) .cse62 (+ (- 4294967296) .cse62)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse25 (= ~globalArgv~0.base 0)) (.cse26 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse27 (= (select |#valid| 0) 0)) (.cse28 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse29 (= (select |#length| 1) 1)) (.cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse31 (= (select |#valid| 2) 1)) (.cse32 (= |#NULL.offset| 0)) (.cse33 (= ~globalFalse~0 0)) (.cse34 (= ~globalArgc~0 0)) (.cse35 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse36 (= (select |#valid| 6) 1)) (.cse37 (= 5 ~globalFive~0)) (.cse38 (= (select |#length| 4) 54)) (.cse39 (< 0 |#StackHeapBarrier|)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= ~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) (and .cse0 .cse1 .cse2 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse42 (mod (let ((.cse44 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse46 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse43 (= .cse46 0)) (.cse45 (= .cse44 0)) (.cse47 (= .cse46 .cse44))) (ite (= (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse42 2147483647) .cse42 (+ .cse42 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse29 .cse31 .cse32 .cse33 .cse48 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse49 (mod (+ 4294967295 (* (let ((.cse51 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse53 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse50 (= .cse53 0)) (.cse52 (= .cse51 0)) (.cse54 (= .cse53 .cse51))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_147))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse49 2147483647) .cse49 (+ .cse49 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse55 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse56 (mod (let ((.cse58 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse60 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse57 (= .cse60 0)) (.cse59 (= .cse58 0)) (.cse61 (= .cse58 .cse60))) (ite (= (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse56 2147483647) .cse56 (+ .cse56 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse48 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse55 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41))) [2022-11-22 00:39:34,418 INFO L895 garLoopResultBuilder]: At program point L1565(line 1565) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:39:34,418 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-22 00:39:34,418 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1605) no Hoare annotation was computed. [2022-11-22 00:39:34,420 INFO L895 garLoopResultBuilder]: At program point L1598-3(lines 1598 1605) the Hoare annotation is: (let ((.cse29 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse9 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse11 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse23 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse67 (mod (let ((.cse69 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ (- 4294967296) .cse67)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse27 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse34 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= (select |#valid| 7) 1)) (.cse14 (= 21 (select |#length| 5))) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse18 (= (select |#length| 3) 54)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse47 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse24 (= ~globalArgv~0.base 0)) (.cse25 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse26 (= (select |#valid| 0) 0)) (.cse28 (= (select |#length| 1) 1)) (.cse30 (= (select |#valid| 2) 1)) (.cse31 (= |#NULL.offset| 0)) (.cse32 (= ~globalFalse~0 0)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse33 (= ~globalArgc~0 0)) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse37 (= (select |#length| 4) 54)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~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 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse41 (mod (let ((.cse43 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse43 .cse45))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse47 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse48 (mod (let ((.cse50 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse52 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse49 (= .cse52 0)) (.cse51 (= .cse50 0)) (.cse53 (= .cse50 .cse52))) (ite (= (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse48 2147483647) .cse48 (+ .cse48 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse54 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse55 (mod (let ((.cse57 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse59 .cse57))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ .cse55 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse47 .cse24 .cse25 .cse26 .cse28 .cse30 .cse31 .cse32 .cse54 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse61 (mod (+ 4294967295 (* (let ((.cse63 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_147))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40))) [2022-11-22 00:39:34,421 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= (select |#valid| 7) 1)) (.cse11 (= 21 (select |#length| 5))) (.cse12 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= (select |#length| 3) 54)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse26 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#valid| 0) 0)) (.cse30 (= (select |#length| 1) 1)) (.cse31 (= (select |#valid| 2) 1)) (.cse32 (= |#NULL.offset| 0)) (.cse33 (= ~globalFalse~0 0)) (.cse34 (= ~globalArgc~0 0)) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse43 (= (select |#length| 4) 54)) (.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 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse14 (mod (let ((.cse16 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse18 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse15 (= .cse18 0)) (.cse17 (= .cse16 0)) (.cse19 (= .cse16 .cse18))) (ite (= (ite .cse15 .cse16 (ite .cse17 .cse18 (ite .cse19 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse15 .cse16 (ite .cse17 .cse18 (ite .cse19 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse15 .cse16 (ite .cse17 .cse18 (ite .cse19 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse14 2147483647) .cse14 (+ .cse14 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse37 (mod (let ((.cse39 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse41 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse38 (= .cse41 0)) (.cse40 (= .cse39 0)) (.cse42 (= .cse39 .cse41))) (ite (= (ite .cse38 .cse39 (ite .cse40 .cse41 (ite .cse42 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse38 .cse39 (ite .cse40 .cse41 (ite .cse42 0 v_~bitwiseXor_148))) (ite (= (ite .cse38 .cse39 (ite .cse40 .cse41 (ite .cse42 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse37 2147483647) .cse37 (+ .cse37 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse47 (mod (let ((.cse49 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse51 .cse49))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse53 (mod (+ 4294967295 (* (let ((.cse55 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse57 .cse55))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_147))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ .cse53 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse34 .cse35 .cse36 .cse43 .cse44 .cse45 .cse46))) [2022-11-22 00:39:34,422 INFO L895 garLoopResultBuilder]: At program point L1640(line 1640) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:39:34,422 INFO L899 garLoopResultBuilder]: For program point L1640-1(line 1640) no Hoare annotation was computed. [2022-11-22 00:39:34,422 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-22 00:39:34,422 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1591) no Hoare annotation was computed. [2022-11-22 00:39:34,422 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: false [2022-11-22 00:39:34,422 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-22 00:39:34,423 INFO L899 garLoopResultBuilder]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2022-11-22 00:39:34,423 INFO L902 garLoopResultBuilder]: At program point L1642(line 1642) the Hoare annotation is: true [2022-11-22 00:39:34,423 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-22 00:39:34,423 INFO L902 garLoopResultBuilder]: At program point L1642-1(line 1642) the Hoare annotation is: true [2022-11-22 00:39:34,423 INFO L899 garLoopResultBuilder]: For program point L1609-1(line 1609) no Hoare annotation was computed. [2022-11-22 00:39:34,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-22 00:39:34,424 INFO L902 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: true [2022-11-22 00:39:34,425 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse63 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (select |#length| 3) 54)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse70 (mod (let ((.cse72 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse74 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse71 (= .cse74 0)) (.cse73 (= .cse72 0)) (.cse75 (= .cse72 .cse74))) (ite (= (ite .cse71 .cse72 (ite .cse73 .cse74 (ite .cse75 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse71 .cse72 (ite .cse73 .cse74 (ite .cse75 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse71 .cse72 (ite .cse73 .cse74 (ite .cse75 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse70 2147483647) .cse70 (+ (- 4294967296) .cse70)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse34 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse56 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse40 (= ~globalArgc~0 0)) (.cse41 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#length| 4) 54)) (.cse45 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse46 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse15 (mod (let ((.cse17 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse19 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse16 (= .cse19 0)) (.cse18 (= .cse17 0)) (.cse20 (= .cse17 .cse19))) (ite (= (ite .cse16 .cse17 (ite .cse18 .cse19 (ite .cse20 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse16 .cse17 (ite .cse18 .cse19 (ite .cse20 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse16 .cse17 (ite .cse18 .cse19 (ite .cse20 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse15 2147483647) .cse15 (+ .cse15 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse50 (mod (let ((.cse52 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse54 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse51 (= .cse54 0)) (.cse53 (= .cse52 0)) (.cse55 (= .cse54 .cse52))) (ite (= (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse50 2147483647) .cse50 (+ .cse50 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse56 .cse39 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse57 (mod (+ 4294967295 (* (let ((.cse59 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse61 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse58 (= .cse61 0)) (.cse60 (= .cse59 0)) (.cse62 (= .cse61 .cse59))) (ite (= (ite .cse58 .cse59 (ite .cse60 .cse61 (ite .cse62 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse58 .cse59 (ite .cse60 .cse61 (ite .cse62 0 v_~bitwiseXor_147))) (ite (= (ite .cse58 .cse59 (ite .cse60 .cse61 (ite .cse62 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse57 2147483647) .cse57 (+ .cse57 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse63 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse63 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse64 (mod (let ((.cse66 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse68 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse65 (= .cse68 0)) (.cse67 (= .cse66 0)) (.cse69 (= .cse66 .cse68))) (ite (= (ite .cse65 .cse66 (ite .cse67 .cse68 (ite .cse69 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse65 .cse66 (ite .cse67 .cse68 (ite .cse69 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse65 .cse66 (ite .cse67 .cse68 (ite .cse69 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse64 2147483647) .cse64 (+ .cse64 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse56 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-22 00:39:34,426 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-11-22 00:39:34,426 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-22 00:39:34,426 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:39:34,426 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-11-22 00:39:34,426 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-22 00:39:34,428 INFO L895 garLoopResultBuilder]: At program point L1618-4(lines 1618 1621) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse10 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse50 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse71 (mod (let ((.cse73 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse75 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse72 (= .cse75 0)) (.cse74 (= .cse73 0)) (.cse76 (= .cse73 .cse75))) (ite (= (ite .cse72 .cse73 (ite .cse74 .cse75 (ite .cse76 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse72 .cse73 (ite .cse74 .cse75 (ite .cse76 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse72 .cse73 (ite .cse74 .cse75 (ite .cse76 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse71 2147483647) .cse71 (+ .cse71 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647)))) (.cse22 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse65 (mod (let ((.cse67 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse69 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse66 (= .cse69 0)) (.cse68 (= .cse67 0)) (.cse70 (= .cse67 .cse69))) (ite (= (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse66 .cse67 (ite .cse68 .cse69 (ite .cse70 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse65 2147483647) .cse65 (+ (- 4294967296) .cse65)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse51 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse17 (= (select |#length| 3) 54)) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= (select |#valid| 4) 1)) (.cse20 (= (select |#valid| 1) 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse39 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#length| 4) 54)) (.cse45 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse46 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse23 (mod (let ((.cse25 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse27 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse24 (= .cse27 0)) (.cse26 (= .cse25 0)) (.cse28 (= .cse25 .cse27))) (ite (= (ite .cse24 .cse25 (ite .cse26 .cse27 (ite .cse28 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse24 .cse25 (ite .cse26 .cse27 (ite .cse28 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse24 .cse25 (ite .cse26 .cse27 (ite .cse28 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse23 2147483647) .cse23 (+ .cse23 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse50 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse29 .cse30 .cse31 .cse32 .cse33 .cse51 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse50 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse51 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse53 (mod (let ((.cse55 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse57 .cse55))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ .cse53 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse59 (mod (+ 4294967295 (* (let ((.cse61 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse63 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse60 (= .cse63 0)) (.cse62 (= .cse61 0)) (.cse64 (= .cse63 .cse61))) (ite (= (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_147))) (ite (= (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse59 2147483647) .cse59 (+ .cse59 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-22 00:39:34,429 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1555) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:39:34,430 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse9 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse49 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= (select |#valid| 7) 1)) (.cse14 (= 21 (select |#length| 5))) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse18 (= (select |#length| 3) 54)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse68 (mod (let ((.cse70 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse72 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse69 (= .cse72 0)) (.cse71 (= .cse70 0)) (.cse73 (= .cse70 .cse72))) (ite (= (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse68 2147483647) .cse68 (+ (- 4294967296) .cse68)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse48 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse24 (= ~globalArgv~0.base 0)) (.cse25 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse26 (= (select |#valid| 0) 0)) (.cse27 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse28 (= (select |#length| 1) 1)) (.cse29 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse30 (= (select |#valid| 2) 1)) (.cse31 (= |#NULL.offset| 0)) (.cse32 (= ~globalFalse~0 0)) (.cse33 (= ~globalArgc~0 0)) (.cse34 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse37 (= (select |#length| 4) 54)) (.cse38 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse39 (< 0 |#StackHeapBarrier|)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= ~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 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse42 (mod (let ((.cse44 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse46 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse43 (= .cse46 0)) (.cse45 (= .cse44 0)) (.cse47 (= .cse46 .cse44))) (ite (= (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse42 2147483647) .cse42 (+ .cse42 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse48 .cse24 .cse25 .cse26 .cse28 .cse30 .cse31 .cse32 .cse49 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse50 (mod (+ 4294967295 (* (let ((.cse52 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse54 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse51 (= .cse54 0)) (.cse53 (= .cse52 0)) (.cse55 (= .cse54 .cse52))) (ite (= (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_147))) (ite (= (ite .cse51 .cse52 (ite .cse53 .cse54 (ite .cse55 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse50 2147483647) .cse50 (+ .cse50 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse56 (mod (let ((.cse58 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse60 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse57 (= .cse60 0)) (.cse59 (= .cse58 0)) (.cse61 (= .cse58 .cse60))) (ite (= (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse57 .cse58 (ite .cse59 .cse60 (ite .cse61 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse56 2147483647) .cse56 (+ .cse56 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse49 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse62 (mod (let ((.cse64 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse66 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse63 (= .cse66 0)) (.cse65 (= .cse64 0)) (.cse67 (= .cse64 .cse66))) (ite (= (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse62 2147483647) .cse62 (+ .cse62 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse48 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41))) [2022-11-22 00:39:34,431 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (= (select |#length| 3) 54)) (.cse17 (= 16 (select |#length| 7))) (.cse18 (= (select |#valid| 4) 1)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse21 (= ~globalArgv~0.base 0)) (.cse22 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse23 (= (select |#valid| 0) 0)) (.cse24 (= (select |#length| 1) 1)) (.cse25 (= (select |#valid| 2) 1)) (.cse26 (= |#NULL.offset| 0)) (.cse27 (= ~globalFalse~0 0)) (.cse28 (= ~globalArgc~0 0)) (.cse29 (= (select |#valid| 6) 1)) (.cse30 (= 5 ~globalFive~0)) (.cse37 (= (select |#length| 4) 54)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~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 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse31 (mod (let ((.cse33 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse35 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse32 (= .cse35 0)) (.cse34 (= .cse33 0)) (.cse36 (= .cse33 .cse35))) (ite (= (ite .cse32 .cse33 (ite .cse34 .cse35 (ite .cse36 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse32 .cse33 (ite .cse34 .cse35 (ite .cse36 0 v_~bitwiseXor_148))) (ite (= (ite .cse32 .cse33 (ite .cse34 .cse35 (ite .cse36 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse31 2147483647) .cse31 (+ .cse31 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse37 .cse38 .cse39 .cse40) (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 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse41 (mod (+ 4294967295 (* (let ((.cse43 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse45 .cse43))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_147))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse28 .cse29 .cse30 .cse37 .cse38 .cse39 .cse40))) [2022-11-22 00:39:34,431 INFO L899 garLoopResultBuilder]: For program point L1577-1(line 1577) no Hoare annotation was computed. [2022-11-22 00:39:34,432 INFO L895 garLoopResultBuilder]: At program point L1577-4(lines 1577 1580) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= (select |#valid| 7) 1)) (.cse11 (= 21 (select |#length| 5))) (.cse12 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse15 (= (select |#length| 3) 54)) (.cse16 (= 16 (select |#length| 7))) (.cse17 (= (select |#valid| 4) 1)) (.cse18 (= (select |#valid| 1) 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse20 (= ~globalArgv~0.base 0)) (.cse21 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse22 (= (select |#valid| 0) 0)) (.cse23 (= (select |#length| 1) 1)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= ~globalFalse~0 0)) (.cse27 (= ~globalArgc~0 0)) (.cse28 (= (select |#valid| 6) 1)) (.cse29 (= 5 ~globalFive~0)) (.cse36 (= (select |#length| 4) 54)) (.cse37 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse30 (mod (let ((.cse32 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse34 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse31 (= .cse34 0)) (.cse33 (= .cse32 0)) (.cse35 (= .cse32 .cse34))) (ite (= (ite .cse31 .cse32 (ite .cse33 .cse34 (ite .cse35 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse31 .cse32 (ite .cse33 .cse34 (ite .cse35 0 v_~bitwiseXor_148))) (ite (= (ite .cse31 .cse32 (ite .cse33 .cse34 (ite .cse35 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse30 2147483647) .cse30 (+ .cse30 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse36 .cse37 (exists ((v_~bitwiseXor_183 Int) (v_~bitwiseXor_180 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet107#1_17| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17| Int) (v_~bitwiseXor_177 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet108#1_17| Int) (v_~bitwiseXor_178 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet108#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet108#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet107#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet107#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse38 (mod (+ 4294967295 (* 4294967295 (let ((.cse40 (* |v_ULTIMATE.start_goodB2G2_#t~nondet108#1_17| 32768)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet107#1_17|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse40 .cse42))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_178))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_180))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17| (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_177)))) 0 v_~bitwiseXor_183))))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ .cse38 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet109#1_17| 2147483647))) .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse48 .cse50))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse52 (mod (+ 4294967295 (* (let ((.cse54 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse56 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse53 (= .cse56 0)) (.cse55 (= .cse54 0)) (.cse57 (= .cse56 .cse54))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_147))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse52 2147483647) .cse52 (+ .cse52 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) .cse27 .cse28 .cse29 .cse36 .cse37 .cse44 .cse45))) [2022-11-22 00:39:34,433 INFO L895 garLoopResultBuilder]: At program point L1569(line 1569) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| Int) (v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= (let ((.cse0 (mod (+ 4294967295 (* (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse4 .cse2))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_147))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) 0 v_~bitwiseXor_150))))) 4294967295)) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_16| 2147483647))) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 00:39:34,433 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:39:34,433 INFO L899 garLoopResultBuilder]: For program point L1569-1(lines 1556 1571) no Hoare annotation was computed. [2022-11-22 00:39:34,433 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-22 00:39:34,433 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1613) no Hoare annotation was computed. [2022-11-22 00:39:34,434 INFO L895 garLoopResultBuilder]: At program point L1586(line 1586) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse8 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646)) (.cse17 (= (select |#length| 3) 54)) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= (select |#valid| 4) 1)) (.cse20 (= (select |#valid| 1) 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse22 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse38 (mod (let ((.cse40 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse40 .cse42))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ (- 4294967296) .cse38)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse26 (= (select |#length| 1) 1)) (.cse27 (= (select |#valid| 2) 1)) (.cse28 (= |#NULL.offset| 0)) (.cse29 (= ~globalFalse~0 0)) (.cse30 (= ~globalArgc~0 0)) (.cse31 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse32 (= (select |#valid| 6) 1)) (.cse33 (= 5 ~globalFive~0)) (.cse34 (= (select |#length| 4) 54)) (.cse35 (< 0 |#StackHeapBarrier|)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37))) [2022-11-22 00:39:34,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-22 00:39:34,434 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 1570) no Hoare annotation was computed. [2022-11-22 00:39:34,435 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-22 00:39:34,435 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-22 00:39:34,435 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-22 00:39:34,438 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:39:34,440 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:39:34,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:39:34 BoogieIcfgContainer [2022-11-22 00:39:34,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:39:34,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:39:34,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:39:34,450 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:39:34,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:16" (3/4) ... [2022-11-22 00:39:34,454 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:39:34,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 00:39:34,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-22 00:39:34,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 00:39:34,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-22 00:39:34,465 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-22 00:39:34,466 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-22 00:39:34,466 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 00:39:34,467 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:39:34,513 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:39:34,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:39:34,513 INFO L158 Benchmark]: Toolchain (without parser) took 320037.80ms. Allocated memory was 182.5MB in the beginning and 398.5MB in the end (delta: 216.0MB). Free memory was 145.3MB in the beginning and 291.5MB in the end (delta: -146.2MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,514 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:39:34,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1278.90ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 97.4MB in the end (delta: 47.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.56ms. Allocated memory is still 182.5MB. Free memory was 97.4MB in the beginning and 93.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,515 INFO L158 Benchmark]: Boogie Preprocessor took 34.27ms. Allocated memory is still 182.5MB. Free memory was 93.2MB in the beginning and 91.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:39:34,515 INFO L158 Benchmark]: RCFGBuilder took 792.25ms. Allocated memory is still 182.5MB. Free memory was 91.8MB in the beginning and 133.7MB in the end (delta: -41.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,515 INFO L158 Benchmark]: TraceAbstraction took 317757.45ms. Allocated memory was 182.5MB in the beginning and 398.5MB in the end (delta: 216.0MB). Free memory was 133.7MB in the beginning and 296.8MB in the end (delta: -163.1MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,516 INFO L158 Benchmark]: Witness Printer took 62.86ms. Allocated memory is still 398.5MB. Free memory was 295.7MB in the beginning and 291.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:39:34,518 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.21ms. Allocated memory is still 117.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1278.90ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 97.4MB in the end (delta: 47.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.56ms. Allocated memory is still 182.5MB. Free memory was 97.4MB in the beginning and 93.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.27ms. Allocated memory is still 182.5MB. Free memory was 93.2MB in the beginning and 91.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 792.25ms. Allocated memory is still 182.5MB. Free memory was 91.8MB in the beginning and 133.7MB in the end (delta: -41.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 317757.45ms. Allocated memory was 182.5MB in the beginning and 398.5MB in the end (delta: 216.0MB). Free memory was 133.7MB in the beginning and 296.8MB in the end (delta: -163.1MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. * Witness Printer took 62.86ms. Allocated memory is still 398.5MB. Free memory was 295.7MB in the beginning and 291.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 317.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 71.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 89.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 2240 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1457 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4097 IncrementalHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 783 mSDtfsCounter, 4097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1047 GetRequests, 805 SyntacticMatches, 24 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 178.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 95 PreInvPairs, 126 NumberOfFragments, 22125 HoareAnnotationTreeSize, 95 FomulaSimplifications, 904 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 23 FomulaSimplificationsInter, 39109 FormulaSimplificationTreeSizeReductionInter, 88.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1578 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1757 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 696/716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 16.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 212, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 132, TOOLS_POST_TIME: 4.2s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 6.3s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 3.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 372, TOOLS_QUANTIFIERELIM_TIME: 13.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 512, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 1.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 212, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 6394, DAG_COMPRESSION_RETAINED_NODES: 524, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1642]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 00:39:34,751 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-22 00:39:34,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f68b28d-c92a-4f1b-ba66-d3a617dcf18f/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE