./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 91ca7f49b47c58892fdb758a58b795fbaf69396eb4fd769aff0472548ca480e5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:43:00,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:43:00,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:43:00,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:43:00,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:43:00,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:43:00,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:43:00,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:43:00,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:43:00,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:43:00,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:43:00,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:43:00,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:43:00,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:43:00,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:43:00,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:43:00,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:43:00,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:43:00,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:43:00,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:43:00,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:43:00,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:43:00,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:43:00,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:43:00,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:43:00,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:43:00,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:43:00,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:43:00,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:43:00,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:43:00,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:43:00,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:43:00,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:43:00,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:43:00,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:43:00,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:43:00,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:43:00,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:43:00,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:43:00,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:43:00,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:43:01,000 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 06:43:01,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:43:01,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:43:01,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:43:01,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:43:01,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:43:01,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:43:01,043 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:43:01,043 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:43:01,043 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:43:01,044 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:43:01,045 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:43:01,045 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:43:01,045 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:43:01,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:43:01,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:43:01,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:43:01,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:43:01,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:43:01,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:43:01,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:43:01,050 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 06:43:01,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:43:01,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:43:01,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:43:01,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:43:01,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:43:01,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:43:01,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:43:01,053 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:43:01,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:43:01,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:43:01,054 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:43:01,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:43:01,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:43:01,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:43:01,055 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_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91ca7f49b47c58892fdb758a58b795fbaf69396eb4fd769aff0472548ca480e5 [2022-11-19 06:43:01,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:43:01,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:43:01,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:43:01,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:43:01,317 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:43:01,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-11-19 06:43:01,389 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/data/692d84c6b/e0f961f27eed4d0292510b1418eb4a9b/FLAG7e2e509ef [2022-11-19 06:43:02,126 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:43:02,126 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-11-19 06:43:02,165 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/data/692d84c6b/e0f961f27eed4d0292510b1418eb4a9b/FLAG7e2e509ef [2022-11-19 06:43:02,306 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/data/692d84c6b/e0f961f27eed4d0292510b1418eb4a9b [2022-11-19 06:43:02,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:43:02,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:43:02,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:43:02,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:43:02,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:43:02,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:43:02" (1/1) ... [2022-11-19 06:43:02,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f2b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:02, skipping insertion in model container [2022-11-19 06:43:02,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:43:02" (1/1) ... [2022-11-19 06:43:02,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:43:02,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:43:02,801 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:43:03,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:43:03,256 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:43:03,275 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:43:03,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:43:03,481 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:43:03,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03 WrapperNode [2022-11-19 06:43:03,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:43:03,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:43:03,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:43:03,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:43:03,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,578 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-11-19 06:43:03,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:43:03,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:43:03,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:43:03,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:43:03,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,639 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:43:03,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:43:03,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:43:03,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:43:03,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (1/1) ... [2022-11-19 06:43:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:43:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:03,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:43:03,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:43:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 06:43:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 06:43:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 06:43:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 06:43:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-19 06:43:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:43:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:43:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:43:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-19 06:43:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-19 06:43:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 06:43:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:43:03,891 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:43:03,894 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:43:04,293 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:43:04,326 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:43:04,326 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:43:04,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:43:04 BoogieIcfgContainer [2022-11-19 06:43:04,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:43:04,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:43:04,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:43:04,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:43:04,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:43:02" (1/3) ... [2022-11-19 06:43:04,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143d9c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:43:04, skipping insertion in model container [2022-11-19 06:43:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:43:03" (2/3) ... [2022-11-19 06:43:04,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143d9c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:43:04, skipping insertion in model container [2022-11-19 06:43:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:43:04" (3/3) ... [2022-11-19 06:43:04,338 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-11-19 06:43:04,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:43:04,356 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 06:43:04,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:43:04,413 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;@3f080b77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:43:04,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 06:43:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 06:43:04,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:04,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:04,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1454760411, now seen corresponding path program 1 times [2022-11-19 06:43:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:04,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694310975] [2022-11-19 06:43:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:43:04,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:04,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694310975] [2022-11-19 06:43:04,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694310975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:04,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:04,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:43:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624756192] [2022-11-19 06:43:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:04,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:04,824 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:43:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:04,957 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-11-19 06:43:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2022-11-19 06:43:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:04,981 INFO L225 Difference]: With dead ends: 145 [2022-11-19 06:43:04,981 INFO L226 Difference]: Without dead ends: 72 [2022-11-19 06:43:04,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:04,992 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:04,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:43:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-19 06:43:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-19 06:43:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:43:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-11-19 06:43:05,041 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-11-19 06:43:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:05,042 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-19 06:43:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:43:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-11-19 06:43:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:43:05,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:05,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:05,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:43:05,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 588789408, now seen corresponding path program 1 times [2022-11-19 06:43:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365651058] [2022-11-19 06:43:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:43:05,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:05,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365651058] [2022-11-19 06:43:05,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365651058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:05,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:05,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:43:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250099060] [2022-11-19 06:43:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:05,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:05,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:05,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:05,141 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:43:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:05,189 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2022-11-19 06:43:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-11-19 06:43:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:05,192 INFO L225 Difference]: With dead ends: 174 [2022-11-19 06:43:05,192 INFO L226 Difference]: Without dead ends: 121 [2022-11-19 06:43:05,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:05,194 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:05,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 183 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-19 06:43:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2022-11-19 06:43:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:43:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2022-11-19 06:43:05,223 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 20 [2022-11-19 06:43:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:05,223 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-11-19 06:43:05,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:43:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2022-11-19 06:43:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 06:43:05,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:05,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:05,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:43:05,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:05,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1072602544, now seen corresponding path program 1 times [2022-11-19 06:43:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:05,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789750924] [2022-11-19 06:43:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:43:05,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:05,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789750924] [2022-11-19 06:43:05,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789750924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:05,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:05,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:43:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810155053] [2022-11-19 06:43:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:05,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:05,320 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:43:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:05,368 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2022-11-19 06:43:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-11-19 06:43:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:05,371 INFO L225 Difference]: With dead ends: 120 [2022-11-19 06:43:05,371 INFO L226 Difference]: Without dead ends: 119 [2022-11-19 06:43:05,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:05,373 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:05,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 215 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-19 06:43:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2022-11-19 06:43:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:43:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-19 06:43:05,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-11-19 06:43:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:05,394 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-19 06:43:05,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:43:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-19 06:43:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-19 06:43:05,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:05,396 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:05,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:43:05,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1064420024, now seen corresponding path program 1 times [2022-11-19 06:43:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:05,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433566169] [2022-11-19 06:43:05,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:05,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 06:43:05,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:05,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433566169] [2022-11-19 06:43:05,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433566169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:05,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778681893] [2022-11-19 06:43:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:05,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:05,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:05,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:43:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:05,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:43:05,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:43:05,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778681893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:05,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:05,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-19 06:43:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057100171] [2022-11-19 06:43:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:05,809 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-19 06:43:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:05,844 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-11-19 06:43:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-11-19 06:43:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:05,847 INFO L225 Difference]: With dead ends: 146 [2022-11-19 06:43:05,847 INFO L226 Difference]: Without dead ends: 106 [2022-11-19 06:43:05,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:05,849 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:05,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:05,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-19 06:43:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-11-19 06:43:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-11-19 06:43:05,861 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-11-19 06:43:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:05,861 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-11-19 06:43:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-19 06:43:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-11-19 06:43:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 06:43:05,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:05,863 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:05,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 06:43:06,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:06,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1061021213, now seen corresponding path program 1 times [2022-11-19 06:43:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:06,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163198225] [2022-11-19 06:43:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:43:06,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163198225] [2022-11-19 06:43:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163198225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:06,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:06,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:43:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799362812] [2022-11-19 06:43:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:06,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:06,144 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-19 06:43:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:06,175 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-11-19 06:43:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:06,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-11-19 06:43:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:06,177 INFO L225 Difference]: With dead ends: 106 [2022-11-19 06:43:06,177 INFO L226 Difference]: Without dead ends: 105 [2022-11-19 06:43:06,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:06,179 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:06,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 186 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-19 06:43:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-11-19 06:43:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-11-19 06:43:06,188 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-11-19 06:43:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:06,189 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-11-19 06:43:06,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-19 06:43:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-11-19 06:43:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 06:43:06,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:06,191 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:06,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:43:06,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1468080885, now seen corresponding path program 1 times [2022-11-19 06:43:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:06,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30466343] [2022-11-19 06:43:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:43:06,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:06,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30466343] [2022-11-19 06:43:06,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30466343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:06,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:06,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:43:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660244762] [2022-11-19 06:43:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:06,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:06,261 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-19 06:43:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:06,291 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-11-19 06:43:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-19 06:43:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:06,293 INFO L225 Difference]: With dead ends: 105 [2022-11-19 06:43:06,293 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 06:43:06,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:06,294 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:06,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 06:43:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-11-19 06:43:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-11-19 06:43:06,305 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-11-19 06:43:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:06,320 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-11-19 06:43:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-19 06:43:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-11-19 06:43:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 06:43:06,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:06,324 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:06,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:43:06,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -690215343, now seen corresponding path program 1 times [2022-11-19 06:43:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309418503] [2022-11-19 06:43:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 06:43:06,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:06,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309418503] [2022-11-19 06:43:06,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309418503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:06,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859230768] [2022-11-19 06:43:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:06,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:06,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:43:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:06,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:43:06,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 06:43:06,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:06,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859230768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:06,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:06,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:43:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708483156] [2022-11-19 06:43:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:06,690 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:43:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:06,725 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2022-11-19 06:43:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:06,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-11-19 06:43:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:06,728 INFO L225 Difference]: With dead ends: 79 [2022-11-19 06:43:06,728 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 06:43:06,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:06,730 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 06:43:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-19 06:43:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2022-11-19 06:43:06,759 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 42 [2022-11-19 06:43:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:06,760 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2022-11-19 06:43:06,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:43:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2022-11-19 06:43:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-19 06:43:06,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:06,764 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:06,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:06,971 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-19 06:43:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 78161000, now seen corresponding path program 1 times [2022-11-19 06:43:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:06,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045664326] [2022-11-19 06:43:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 06:43:07,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:07,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045664326] [2022-11-19 06:43:07,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045664326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:07,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804716214] [2022-11-19 06:43:07,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:07,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:07,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:43:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:07,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:43:07,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 06:43:07,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:07,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804716214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:07,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:07,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:43:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880619490] [2022-11-19 06:43:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:07,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:07,217 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:43:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:07,260 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2022-11-19 06:43:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-11-19 06:43:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:07,263 INFO L225 Difference]: With dead ends: 110 [2022-11-19 06:43:07,263 INFO L226 Difference]: Without dead ends: 96 [2022-11-19 06:43:07,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:07,266 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:07,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-19 06:43:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-19 06:43:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:43:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-19 06:43:07,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 43 [2022-11-19 06:43:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:07,292 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-19 06:43:07,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:43:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-19 06:43:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 06:43:07,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:07,297 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:07,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:07,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:07,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 639981950, now seen corresponding path program 1 times [2022-11-19 06:43:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:07,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169983285] [2022-11-19 06:43:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:43:07,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:07,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169983285] [2022-11-19 06:43:07,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169983285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333290399] [2022-11-19 06:43:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:07,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:07,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:43:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:07,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:43:07,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:07,814 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-19 06:43:07,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333290399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:07,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-19 06:43:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168924430] [2022-11-19 06:43:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:07,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:07,821 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:43:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:07,857 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-11-19 06:43:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-11-19 06:43:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:07,860 INFO L225 Difference]: With dead ends: 111 [2022-11-19 06:43:07,860 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 06:43:07,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:43:07,867 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:07,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 06:43:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-11-19 06:43:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:43:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-11-19 06:43:07,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 46 [2022-11-19 06:43:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:07,882 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-11-19 06:43:07,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:43:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-11-19 06:43:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-19 06:43:07,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:07,889 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:07,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:08,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:08,099 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-19 06:43:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1371327926, now seen corresponding path program 1 times [2022-11-19 06:43:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:08,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980360125] [2022-11-19 06:43:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:08,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:08,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:08,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980360125] [2022-11-19 06:43:08,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980360125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:08,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435084881] [2022-11-19 06:43:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:08,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:08,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:08,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:43:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:08,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:43:08,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:43:08,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435084881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:08,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:08,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:43:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564999725] [2022-11-19 06:43:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:08,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:43:08,342 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:08,393 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2022-11-19 06:43:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2022-11-19 06:43:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:08,396 INFO L225 Difference]: With dead ends: 120 [2022-11-19 06:43:08,397 INFO L226 Difference]: Without dead ends: 81 [2022-11-19 06:43:08,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:43:08,398 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:08,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-19 06:43:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-19 06:43:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 61 states have internal predecessors, (69), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:43:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-11-19 06:43:08,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 52 [2022-11-19 06:43:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:08,409 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-11-19 06:43:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-11-19 06:43:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:43:08,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:08,412 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:08,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:08,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 06:43:08,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1433554075, now seen corresponding path program 1 times [2022-11-19 06:43:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:08,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554548092] [2022-11-19 06:43:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:08,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554548092] [2022-11-19 06:43:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554548092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472722809] [2022-11-19 06:43:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:08,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:08,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:43:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:08,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:43:08,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 06:43:08,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472722809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:08,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:08,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:43:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825967204] [2022-11-19 06:43:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:08,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:43:08,912 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:08,973 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2022-11-19 06:43:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2022-11-19 06:43:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:08,977 INFO L225 Difference]: With dead ends: 116 [2022-11-19 06:43:08,977 INFO L226 Difference]: Without dead ends: 81 [2022-11-19 06:43:08,977 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-19 06:43:08,978 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:08,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-19 06:43:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-19 06:43:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 61 states have internal predecessors, (67), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:43:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2022-11-19 06:43:08,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 54 [2022-11-19 06:43:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:08,986 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2022-11-19 06:43:08,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2022-11-19 06:43:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-19 06:43:08,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:08,987 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:08,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:09,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:09,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1034683846, now seen corresponding path program 1 times [2022-11-19 06:43:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992976538] [2022-11-19 06:43:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:09,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:09,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992976538] [2022-11-19 06:43:09,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992976538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:09,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968660829] [2022-11-19 06:43:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:09,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:09,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:09,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:43:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:09,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:43:09,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:43:09,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:09,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968660829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:09,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:09,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:43:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988504203] [2022-11-19 06:43:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:09,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:43:09,456 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:09,487 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2022-11-19 06:43:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-11-19 06:43:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:09,489 INFO L225 Difference]: With dead ends: 94 [2022-11-19 06:43:09,489 INFO L226 Difference]: Without dead ends: 81 [2022-11-19 06:43:09,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:43:09,490 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:09,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-19 06:43:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-19 06:43:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 61 states have internal predecessors, (65), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:43:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2022-11-19 06:43:09,496 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 55 [2022-11-19 06:43:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:09,496 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2022-11-19 06:43:09,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:43:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-11-19 06:43:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-19 06:43:09,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:09,498 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:09,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:09,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:43:09,704 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-19 06:43:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1352103455, now seen corresponding path program 1 times [2022-11-19 06:43:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673575150] [2022-11-19 06:43:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:43:09,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:09,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673575150] [2022-11-19 06:43:09,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673575150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:09,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:43:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059406312] [2022-11-19 06:43:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:09,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:09,778 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:43:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:09,801 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-11-19 06:43:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 59 [2022-11-19 06:43:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:09,802 INFO L225 Difference]: With dead ends: 96 [2022-11-19 06:43:09,802 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 06:43:09,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:09,803 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:09,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 06:43:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-19 06:43:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.196078431372549) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:43:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-19 06:43:09,809 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 59 [2022-11-19 06:43:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:09,809 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-19 06:43:09,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:43:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-19 06:43:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-19 06:43:09,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:09,810 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:09,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:43:09,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -893102991, now seen corresponding path program 1 times [2022-11-19 06:43:09,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:09,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630297856] [2022-11-19 06:43:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:09,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630297856] [2022-11-19 06:43:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630297856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037208668] [2022-11-19 06:43:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:09,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:09,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:09,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:43:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:43:10,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:10,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:43:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 06:43:10,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037208668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:43:10,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [938113896] [2022-11-19 06:43:10,290 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-19 06:43:10,291 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:43:10,294 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:43:10,305 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:43:10,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:43:10,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:11,058 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:43:11,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:43:11,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:11,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:11,158 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:43:11,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:43:11,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:11,410 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:43:11,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:43:11,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:11,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:11,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:43:12,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,664 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:43:12,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:43:12,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,945 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:43:12,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:43:12,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:12,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:43:12,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:43:13,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:13,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:13,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:13,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:43:16,320 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:43:16,323 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:43:16,359 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:43:16,495 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:43:16,508 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:43:27,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [938113896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:27,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:43:27,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-11-19 06:43:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767327271] [2022-11-19 06:43:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:27,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 06:43:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 06:43:27,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 06:43:27,831 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:43:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:28,209 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-11-19 06:43:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-19 06:43:28,210 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 61 [2022-11-19 06:43:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:28,211 INFO L225 Difference]: With dead ends: 129 [2022-11-19 06:43:28,211 INFO L226 Difference]: Without dead ends: 128 [2022-11-19 06:43:28,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 06:43:28,212 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 71 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:28,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 237 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 456 Unchecked, 0.3s Time] [2022-11-19 06:43:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-19 06:43:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-11-19 06:43:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.146341463414634) internal successors, (94), 87 states have internal predecessors, (94), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-19 06:43:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2022-11-19 06:43:28,238 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 61 [2022-11-19 06:43:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2022-11-19 06:43:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:43:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2022-11-19 06:43:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-19 06:43:28,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:28,240 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:28,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 06:43:28,447 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1708501342, now seen corresponding path program 1 times [2022-11-19 06:43:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:28,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428690441] [2022-11-19 06:43:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:43:28,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:28,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428690441] [2022-11-19 06:43:28,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428690441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:28,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490255911] [2022-11-19 06:43:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:28,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:28,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:43:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:28,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:43:28,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 06:43:28,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:43:28,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490255911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:28,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:43:28,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-19 06:43:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073680943] [2022-11-19 06:43:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:43:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:43:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:28,672 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:43:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:28,724 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2022-11-19 06:43:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:43:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 63 [2022-11-19 06:43:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:28,726 INFO L225 Difference]: With dead ends: 172 [2022-11-19 06:43:28,726 INFO L226 Difference]: Without dead ends: 120 [2022-11-19 06:43:28,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:43:28,729 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:28,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-19 06:43:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-19 06:43:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 86 states have internal predecessors, (92), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-19 06:43:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-11-19 06:43:28,759 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 63 [2022-11-19 06:43:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:28,759 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-11-19 06:43:28,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:43:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-11-19 06:43:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-19 06:43:28,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:28,765 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:28,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:43:28,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 06:43:28,970 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1916388764, now seen corresponding path program 1 times [2022-11-19 06:43:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:28,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506852972] [2022-11-19 06:43:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-19 06:43:29,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506852972] [2022-11-19 06:43:29,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506852972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:43:29,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:43:29,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:43:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339924334] [2022-11-19 06:43:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:43:29,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:43:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:43:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:43:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:29,070 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-19 06:43:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:43:29,111 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-11-19 06:43:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:43:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2022-11-19 06:43:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:43:29,112 INFO L225 Difference]: With dead ends: 120 [2022-11-19 06:43:29,113 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 06:43:29,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:43:29,114 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:43:29,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:43:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 06:43:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-19 06:43:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 65 states have internal predecessors, (69), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:43:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-11-19 06:43:29,131 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 62 [2022-11-19 06:43:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:43:29,131 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-11-19 06:43:29,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-19 06:43:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-11-19 06:43:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 06:43:29,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:43:29,133 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:43:29,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 06:43:29,133 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:43:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:43:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash -463330025, now seen corresponding path program 1 times [2022-11-19 06:43:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:43:29,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4174572] [2022-11-19 06:43:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:43:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:43:29,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:43:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4174572] [2022-11-19 06:43:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4174572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:43:29,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884349064] [2022-11-19 06:43:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:43:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:43:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:43:29,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:43:29,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:43:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:43:29,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:43:29,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:43:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:43:29,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:43:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:43:29,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884349064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:43:29,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266398655] [2022-11-19 06:43:29,499 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:43:29,499 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:43:29,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:43:29,500 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:43:29,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:43:29,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:29,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:29,944 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:43:29,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:43:29,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:29,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:43:29,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:29,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:43:30,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:30,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:43:30,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:30,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:43:30,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,863 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:43:30,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:43:30,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:43:30,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:43:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:30,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,003 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:43:31,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-11-19 06:43:31,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:43:31,254 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:43:31,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-11-19 06:43:41,550 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:43:41,552 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 209 for LOIs [2022-11-19 06:43:41,673 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:43:41,674 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-11-19 06:43:41,686 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:44:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1266398655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:44:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:44:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-11-19 06:44:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158560707] [2022-11-19 06:44:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:44:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 06:44:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:44:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 06:44:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 06:44:03,194 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:44:04,011 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2022-11-19 06:44:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:44:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-11-19 06:44:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:44:04,013 INFO L225 Difference]: With dead ends: 121 [2022-11-19 06:44:04,013 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 06:44:04,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 144 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:44:04,014 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:44:04,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 607 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 430 Unchecked, 0.4s Time] [2022-11-19 06:44:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 06:44:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-19 06:44:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:44:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2022-11-19 06:44:04,035 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 65 [2022-11-19 06:44:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:44:04,035 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2022-11-19 06:44:04,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2022-11-19 06:44:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 06:44:04,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:44:04,037 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:44:04,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 06:44:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 06:44:04,243 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:44:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:44:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 825442563, now seen corresponding path program 1 times [2022-11-19 06:44:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:44:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507098039] [2022-11-19 06:44:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:44:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:04,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:44:04,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507098039] [2022-11-19 06:44:04,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507098039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:44:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955936031] [2022-11-19 06:44:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:44:04,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:44:04,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 06:44:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:04,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:44:04,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:44:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:04,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:44:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:04,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955936031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:44:04,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230816552] [2022-11-19 06:44:04,639 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:44:04,639 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:44:04,641 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:44:04,641 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:44:04,641 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:44:04,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:04,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:04,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:04,906 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:44:04,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:44:04,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:05,069 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:44:05,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:44:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:05,279 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:44:05,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:44:05,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:05,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:06,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,240 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:44:06,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:44:06,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,504 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:44:06,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:44:06,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:44:06,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:44:06,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:06,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:06,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:06,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:09,194 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:44:09,195 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:44:09,224 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:44:09,363 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:44:09,494 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:44:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [230816552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:44:22,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:44:22,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-11-19 06:44:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351128946] [2022-11-19 06:44:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:44:22,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:44:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:44:22,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:44:22,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:44:22,914 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:44:23,562 INFO L93 Difference]: Finished difference Result 139 states and 162 transitions. [2022-11-19 06:44:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 06:44:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 65 [2022-11-19 06:44:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:44:23,564 INFO L225 Difference]: With dead ends: 139 [2022-11-19 06:44:23,564 INFO L226 Difference]: Without dead ends: 108 [2022-11-19 06:44:23,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:44:23,565 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:44:23,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 235 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 356 Unchecked, 0.2s Time] [2022-11-19 06:44:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-19 06:44:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-19 06:44:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-19 06:44:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2022-11-19 06:44:23,586 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 65 [2022-11-19 06:44:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:44:23,586 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2022-11-19 06:44:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2022-11-19 06:44:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:44:23,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:44:23,588 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:44:23,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 06:44:23,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 06:44:23,793 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:44:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:44:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1968833010, now seen corresponding path program 1 times [2022-11-19 06:44:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:44:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806033065] [2022-11-19 06:44:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:44:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:23,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:44:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806033065] [2022-11-19 06:44:23,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806033065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:44:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82795078] [2022-11-19 06:44:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:23,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:44:23,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:44:23,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 06:44:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:24,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:44:24,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:44:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:24,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:44:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82795078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:44:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1361332021] [2022-11-19 06:44:24,158 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 06:44:24,158 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:44:24,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:44:24,159 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:44:24,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:44:24,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:24,505 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:44:24,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:44:24,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:24,722 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:44:24,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:44:24,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:24,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:24,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:44:24,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:24,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,532 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:44:25,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:44:25,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,787 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:44:25,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:44:25,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:25,870 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:44:25,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:44:25,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:25,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:26,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:26,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:28,801 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:44:28,803 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-11-19 06:44:28,928 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:44:29,029 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:44:29,039 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:44:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1361332021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:44:43,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:44:43,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-11-19 06:44:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436769541] [2022-11-19 06:44:43,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:44:43,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:44:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:44:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:44:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:44:43,405 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:44:43,583 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2022-11-19 06:44:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 06:44:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-11-19 06:44:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:44:43,586 INFO L225 Difference]: With dead ends: 152 [2022-11-19 06:44:43,586 INFO L226 Difference]: Without dead ends: 110 [2022-11-19 06:44:43,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 156 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:44:43,587 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:44:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 347 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 218 Unchecked, 0.1s Time] [2022-11-19 06:44:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-19 06:44:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-19 06:44:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.08) internal successors, (81), 77 states have internal predecessors, (81), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-19 06:44:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-11-19 06:44:43,608 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 67 [2022-11-19 06:44:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:44:43,608 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-11-19 06:44:43,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-11-19 06:44:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:44:43,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:44:43,610 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:44:43,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 06:44:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:43,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:44:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:44:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -975604230, now seen corresponding path program 1 times [2022-11-19 06:44:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:44:43,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410537957] [2022-11-19 06:44:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:44:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:43,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:44:43,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410537957] [2022-11-19 06:44:43,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410537957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:44:43,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333787500] [2022-11-19 06:44:43,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:43,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:44:43,939 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:44:43,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 06:44:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:44,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:44:44,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:44:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:44,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:44:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:44:44,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333787500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:44:44,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839067926] [2022-11-19 06:44:44,176 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 06:44:44,177 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:44:44,178 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:44:44,179 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:44:44,179 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:44:44,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:44,423 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:44:44,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:44:44,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:44,585 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:44:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:44:44,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:44,799 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:44:44,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:44:44,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:44,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:44,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:44,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:45,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:45,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:45,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,896 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:44:45,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:44:45,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,960 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:44:45,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:44:45,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:45,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,126 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:44:46,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-19 06:44:46,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:46,385 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:44:46,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 205 [2022-11-19 06:44:47,305 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:44:47,307 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-11-19 06:44:47,384 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 06:44:47,444 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:44:47,454 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:44:56,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1839067926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:44:56,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:44:56,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-11-19 06:44:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157203967] [2022-11-19 06:44:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:44:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:44:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:44:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:44:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:44:56,439 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:44:56,838 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2022-11-19 06:44:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 06:44:56,838 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 67 [2022-11-19 06:44:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:44:56,839 INFO L225 Difference]: With dead ends: 157 [2022-11-19 06:44:56,839 INFO L226 Difference]: Without dead ends: 135 [2022-11-19 06:44:56,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:44:56,841 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:44:56,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 251 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 217 Unchecked, 0.4s Time] [2022-11-19 06:44:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-19 06:44:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2022-11-19 06:44:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 87 states have internal predecessors, (91), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:44:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2022-11-19 06:44:56,869 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 67 [2022-11-19 06:44:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:44:56,869 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2022-11-19 06:44:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 31 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 06:44:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2022-11-19 06:44:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 06:44:56,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:44:56,870 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:44:56,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 06:44:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:57,077 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:44:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:44:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1770289321, now seen corresponding path program 1 times [2022-11-19 06:44:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:44:57,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509880694] [2022-11-19 06:44:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:44:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:44:57,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:44:57,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509880694] [2022-11-19 06:44:57,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509880694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:44:57,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094105035] [2022-11-19 06:44:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:57,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:44:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:44:57,195 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:44:57,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 06:44:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:57,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:44:57,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:44:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:44:57,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:44:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:44:57,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094105035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:44:57,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748685493] [2022-11-19 06:44:57,447 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 06:44:57,447 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:44:57,447 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:44:57,448 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:44:57,448 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:44:57,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:57,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:57,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:57,774 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:44:57,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:44:57,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:57,830 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:44:57,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:44:57,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,020 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:44:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:44:58,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:44:58,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:58,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:44:58,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,918 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:44:58,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:44:58,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:58,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:59,138 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:44:59,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:44:59,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:59,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:59,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:44:59,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:44:59,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:44:59,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:45:01,685 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:45:01,687 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:45:01,716 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:45:01,813 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 06:45:01,818 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:45:13,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1748685493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:13,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:13,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-11-19 06:45:13,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082492251] [2022-11-19 06:45:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:45:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:45:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:45:13,328 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:45:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:14,004 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-11-19 06:45:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:45:14,005 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-11-19 06:45:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:14,006 INFO L225 Difference]: With dead ends: 160 [2022-11-19 06:45:14,006 INFO L226 Difference]: Without dead ends: 131 [2022-11-19 06:45:14,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:45:14,007 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:14,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 575 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 382 Unchecked, 0.2s Time] [2022-11-19 06:45:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-19 06:45:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2022-11-19 06:45:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 81 states have internal predecessors, (85), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-19 06:45:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2022-11-19 06:45:14,036 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 69 [2022-11-19 06:45:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:14,037 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2022-11-19 06:45:14,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:45:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2022-11-19 06:45:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 06:45:14,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:14,038 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:14,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 06:45:14,244 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:45:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2018831167, now seen corresponding path program 1 times [2022-11-19 06:45:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934578320] [2022-11-19 06:45:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:14,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934578320] [2022-11-19 06:45:14,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934578320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:14,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046402024] [2022-11-19 06:45:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:14,367 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:14,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 06:45:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:14,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:45:14,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:14,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:14,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046402024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:14,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636138401] [2022-11-19 06:45:14,617 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-19 06:45:14,617 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:14,617 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:45:14,617 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:45:14,618 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:45:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,001 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:45:15,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:45:15,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:15,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:45:15,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:45:15,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:15,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:45:15,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:15,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:15,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,950 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:45:15,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:45:15,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,000 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:45:16,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:45:16,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:16,141 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:45:16,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-19 06:45:16,872 INFO L321 Elim1Store]: treesize reduction 370, result has 17.4 percent of original size [2022-11-19 06:45:16,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 66 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 38 case distinctions, treesize of input 639 treesize of output 661 [2022-11-19 06:45:31,277 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 125 for LOIs [2022-11-19 06:45:31,292 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-11-19 06:45:31,293 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:45:31,295 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-11-19 06:45:31,303 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:45:51,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [636138401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:51,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:51,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 37 [2022-11-19 06:45:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121677496] [2022-11-19 06:45:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:51,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-19 06:45:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-19 06:45:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2022-11-19 06:45:51,753 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 27 states have internal predecessors, (38), 11 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-19 06:45:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:52,829 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2022-11-19 06:45:52,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-19 06:45:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 27 states have internal predecessors, (38), 11 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 70 [2022-11-19 06:45:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:52,833 INFO L225 Difference]: With dead ends: 164 [2022-11-19 06:45:52,833 INFO L226 Difference]: Without dead ends: 138 [2022-11-19 06:45:52,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 22 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=228, Invalid=1254, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 06:45:52,834 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 67 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:52,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1075 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 331 Invalid, 0 Unknown, 669 Unchecked, 0.6s Time] [2022-11-19 06:45:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-19 06:45:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2022-11-19 06:45:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 93 states have internal predecessors, (94), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-19 06:45:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2022-11-19 06:45:52,865 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 70 [2022-11-19 06:45:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:52,865 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2022-11-19 06:45:52,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 27 states have internal predecessors, (38), 11 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-19 06:45:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2022-11-19 06:45:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 06:45:52,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:52,867 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:52,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:53,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 06:45:53,072 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:45:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1311259161, now seen corresponding path program 1 times [2022-11-19 06:45:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:53,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640143982] [2022-11-19 06:45:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:53,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:53,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640143982] [2022-11-19 06:45:53,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640143982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:53,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348406306] [2022-11-19 06:45:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:53,169 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:53,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 06:45:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:45:53,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:53,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:45:53,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348406306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:53,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782259293] [2022-11-19 06:45:53,435 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-19 06:45:53,436 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:53,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:45:53,436 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:45:53,436 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:45:53,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:53,795 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:45:53,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:45:53,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:53,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:53,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:53,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:45:53,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:53,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:45:54,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:45:54,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:54,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:45:54,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,602 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:45:54,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:45:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,859 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:45:54,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:45:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:54,907 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:45:54,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:45:55,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:45:55,102 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:45:55,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 146 treesize of output 194 [2022-11-19 06:46:09,736 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:46:09,738 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-11-19 06:46:09,740 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:46:09,742 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:46:09,843 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:46:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1782259293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:46:32,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:46:32,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 38 [2022-11-19 06:46:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928766071] [2022-11-19 06:46:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:46:32,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 06:46:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:46:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 06:46:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 06:46:32,703 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:46:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:46:33,036 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2022-11-19 06:46:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-19 06:46:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 70 [2022-11-19 06:46:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:46:33,038 INFO L225 Difference]: With dead ends: 181 [2022-11-19 06:46:33,038 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 06:46:33,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 159 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 06:46:33,039 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:46:33,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 383 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 383 Unchecked, 0.3s Time] [2022-11-19 06:46:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 06:46:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-19 06:46:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.043010752688172) internal successors, (97), 96 states have internal predecessors, (97), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-19 06:46:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2022-11-19 06:46:33,074 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 70 [2022-11-19 06:46:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:46:33,074 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2022-11-19 06:46:33,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:46:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2022-11-19 06:46:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 06:46:33,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:46:33,075 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:46:33,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 06:46:33,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:46:33,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:46:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:46:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1990479355, now seen corresponding path program 1 times [2022-11-19 06:46:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:46:33,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565413959] [2022-11-19 06:46:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:46:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:46:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:46:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-19 06:46:33,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:46:33,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565413959] [2022-11-19 06:46:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565413959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:46:33,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:46:33,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:46:33,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231392804] [2022-11-19 06:46:33,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:46:33,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:46:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:46:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:46:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:46:33,338 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-19 06:46:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:46:33,384 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2022-11-19 06:46:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:46:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 70 [2022-11-19 06:46:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:46:33,386 INFO L225 Difference]: With dead ends: 174 [2022-11-19 06:46:33,386 INFO L226 Difference]: Without dead ends: 113 [2022-11-19 06:46:33,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:46:33,387 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:46:33,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:46:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-19 06:46:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 89. [2022-11-19 06:46:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 16 states have call successors, (16), 13 states have call predecessors, (16), 13 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 06:46:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-11-19 06:46:33,411 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 70 [2022-11-19 06:46:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:46:33,412 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-11-19 06:46:33,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-19 06:46:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-11-19 06:46:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-19 06:46:33,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:46:33,413 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:46:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-19 06:46:33,413 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:46:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:46:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1350677792, now seen corresponding path program 1 times [2022-11-19 06:46:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:46:33,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311097186] [2022-11-19 06:46:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:46:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:46:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:46:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:33,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:46:33,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311097186] [2022-11-19 06:46:33,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311097186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:46:33,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315767718] [2022-11-19 06:46:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:46:33,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:46:33,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:46:33,531 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:46:33,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 06:46:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:46:33,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:46:33,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:46:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:33,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:46:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:33,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315767718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:46:33,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046821937] [2022-11-19 06:46:33,793 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-11-19 06:46:33,794 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:46:33,794 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:46:33,794 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:46:33,794 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:46:34,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:34,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:34,037 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:46:34,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:46:34,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:34,211 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:46:34,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:46:34,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:34,441 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:46:34,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:46:34,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:34,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:46:35,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,279 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:46:35,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:46:35,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,501 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:46:35,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:46:35,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,555 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:46:35,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:46:35,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:35,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:35,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:35,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:46:38,176 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:46:38,178 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-11-19 06:46:38,288 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:46:38,386 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:46:38,483 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:46:54,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1046821937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:46:54,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:46:54,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-11-19 06:46:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671584438] [2022-11-19 06:46:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:46:54,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:46:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:46:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:46:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:46:54,958 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:46:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:46:55,161 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2022-11-19 06:46:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:46:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-11-19 06:46:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:46:55,162 INFO L225 Difference]: With dead ends: 118 [2022-11-19 06:46:55,162 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:46:55,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:46:55,163 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:46:55,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 353 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 176 Unchecked, 0.2s Time] [2022-11-19 06:46:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:46:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 06:46:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 13 states have call successors, (13), 10 states have call predecessors, (13), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 06:46:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-19 06:46:55,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 71 [2022-11-19 06:46:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:46:55,179 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-19 06:46:55,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:46:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-19 06:46:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-19 06:46:55,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:46:55,180 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:46:55,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 06:46:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:46:55,381 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:46:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:46:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash 629758496, now seen corresponding path program 1 times [2022-11-19 06:46:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:46:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223778710] [2022-11-19 06:46:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:46:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:46:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:46:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:55,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:46:55,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223778710] [2022-11-19 06:46:55,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223778710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:46:55,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944585981] [2022-11-19 06:46:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:46:55,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:46:55,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:46:55,493 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:46:55,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 06:46:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:46:55,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:46:55,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:46:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:55,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:46:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 06:46:55,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944585981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:46:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1489378497] [2022-11-19 06:46:55,748 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2022-11-19 06:46:55,748 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:46:55,748 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:46:55,748 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:46:55,749 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:46:55,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:56,022 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:46:56,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:46:56,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:56,216 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:46:56,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:46:56,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:56,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:46:56,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:56,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:56,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:56,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:46:57,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,144 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:46:57,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:46:57,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,383 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:46:57,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:46:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,437 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:46:57,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:46:57,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:46:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:46:57,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:46:59,971 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:46:59,972 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 213 for LOIs [2022-11-19 06:47:00,077 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:47:00,171 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:47:00,265 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:47:17,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1489378497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:47:17,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:47:17,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-11-19 06:47:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984555549] [2022-11-19 06:47:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:47:17,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:47:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:47:17,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:47:17,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1588, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:47:17,652 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:47:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:47:17,797 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-19 06:47:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:47:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2022-11-19 06:47:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:47:17,799 INFO L225 Difference]: With dead ends: 97 [2022-11-19 06:47:17,800 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 06:47:17,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=304, Invalid=1588, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:47:17,801 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:47:17,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2022-11-19 06:47:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 06:47:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 06:47:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:47:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-11-19 06:47:17,820 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 71 [2022-11-19 06:47:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:47:17,821 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-11-19 06:47:17,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:47:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-11-19 06:47:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-19 06:47:17,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:47:17,826 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:47:17,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-19 06:47:18,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 06:47:18,027 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:47:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:47:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 517215447, now seen corresponding path program 1 times [2022-11-19 06:47:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:47:18,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361385806] [2022-11-19 06:47:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:47:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:47:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:47:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:47:18,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:47:18,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361385806] [2022-11-19 06:47:18,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361385806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:47:18,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362117782] [2022-11-19 06:47:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:47:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:47:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:47:18,129 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:47:18,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-19 06:47:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:47:18,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:47:18,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:47:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:47:18,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:47:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 06:47:18,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362117782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:47:18,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723568154] [2022-11-19 06:47:18,412 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-19 06:47:18,413 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:47:18,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:47:18,413 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:47:18,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:47:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:18,728 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:47:18,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:47:18,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:18,936 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:47:18,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:47:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:18,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:47:18,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:47:18,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:47:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:47:19,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:47:19,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:47:19,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,877 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:47:19,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:47:19,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:47:19,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:47:19,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,044 INFO L321 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-11-19 06:47:20,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 86 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 133 [2022-11-19 06:47:20,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:47:20,289 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:47:20,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 165 treesize of output 213 [2022-11-19 06:47:36,380 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:47:36,382 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 175 for LOIs [2022-11-19 06:47:36,453 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:47:36,454 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:47:36,466 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:48:01,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1723568154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:01,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:48:01,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-11-19 06:48:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856624087] [2022-11-19 06:48:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:01,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:48:01,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:01,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:48:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:48:01,994 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:48:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:02,213 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-11-19 06:48:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 06:48:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 73 [2022-11-19 06:48:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:02,214 INFO L225 Difference]: With dead ends: 68 [2022-11-19 06:48:02,214 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:48:02,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 160 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:48:02,215 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:02,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-11-19 06:48:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:48:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:48:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:48:02,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-11-19 06:48:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:48:02,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:48:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:48:02,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:48:02,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 06:48:02,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 06:48:02,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 06:48:02,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 06:48:02,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 06:48:02,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 06:48:02,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 06:48:02,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 06:48:02,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:02,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-19 06:48:02,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:48:19,699 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 502 DAG size of output: 433 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 06:48:26,702 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 511 DAG size of output: 435 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 06:48:33,581 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 511 DAG size of output: 435 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 06:48:39,491 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 507 DAG size of output: 436 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 06:48:47,217 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 510 DAG size of output: 432 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-19 06:48:47,223 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 06:48:47,223 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 06:48:47,223 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-19 06:48:47,223 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-19 06:48:47,223 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 06:48:47,223 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1583) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point L1572-1(lines 1566 1584) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:48:47,224 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:48:47,225 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (store ((as const (Array Int Int)) 0) 0 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,225 INFO L899 garLoopResultBuilder]: For program point L1606(lines 1606 1617) no Hoare annotation was computed. [2022-11-19 06:48:47,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-19 06:48:47,225 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse40 (store ((as const (Array Int Int)) 0) 0 0)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (= ~globalArgc~0 0)) (.cse37 (= (select |#valid| 6) 1)) (.cse38 (= (select |#length| 8) 54)) (.cse39 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| Int)) (and (not (= 11 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) .cse40) (not (= 3 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 4 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 10 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| 0)) (not (= 9 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 8 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 14) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 0))) .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse40 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 4)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 9)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7|) .cse40) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_7| 6)))) .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45))) [2022-11-19 06:48:47,225 INFO L899 garLoopResultBuilder]: For program point L1590-1(line 1590) no Hoare annotation was computed. [2022-11-19 06:48:47,226 INFO L899 garLoopResultBuilder]: For program point L1590-2(lines 1590 1603) no Hoare annotation was computed. [2022-11-19 06:48:47,226 INFO L895 garLoopResultBuilder]: At program point L1590-4(lines 1590 1603) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#length| 5) 54)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select (select |#memory_int| 6) 0) 0)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse36 (store ((as const (Array Int Int)) 0) 0 0)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and (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 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse35 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse36) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse36 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse32 .cse33 .cse34 .cse35)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse31 .cse32 .cse33 .cse34 .cse35 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse36) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 06:48:47,227 INFO L895 garLoopResultBuilder]: At program point L1615(line 1615) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse37 (store ((as const (Array Int Int)) 0) 0 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#length| 5) 54)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select (select |#memory_int| 6) 0) 0)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse36 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse37) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= 5 ~globalFive~0) .cse4 .cse5 .cse6 .cse7 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse8 .cse9 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse12 .cse13 .cse14 .cse16 (<= |#NULL.offset| 0) .cse17 .cse18 .cse19 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) .cse25 (<= 0 ~globalArgv~0.base) .cse26 (<= |#NULL.base| 0) .cse28 .cse29 .cse30 (<= ~globalArgv~0.base 0) .cse31 (<= 0 ~globalArgv~0.offset) .cse32 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse35 .cse36 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse37) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse39 .cse40 .cse42 .cse43 .cse44 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse37) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 06:48:47,227 INFO L899 garLoopResultBuilder]: For program point L1574(lines 1574 1582) no Hoare annotation was computed. [2022-11-19 06:48:47,227 INFO L899 garLoopResultBuilder]: For program point L1632(line 1632) no Hoare annotation was computed. [2022-11-19 06:48:47,227 INFO L899 garLoopResultBuilder]: For program point L1632-1(lines 1632 1639) no Hoare annotation was computed. [2022-11-19 06:48:47,227 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-19 06:48:47,227 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1584) no Hoare annotation was computed. [2022-11-19 06:48:47,229 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (let ((.cse51 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse4 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse17 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse57 (<= 0 ~globalArgv~0.base)) (.cse58 (<= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse54 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse59 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse60 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse61 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse41 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse55 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse56 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse41) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse41) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse51 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse52 .cse42 .cse53 .cse54 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse41 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse51 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse56 .cse36 .cse37 .cse38 .cse42 .cse53 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse1 (<= 0 |ULTIMATE.start_goodB2G1_~result~0#1|) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse5 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse18 .cse51 .cse30 .cse37 .cse38 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse42 .cse53 .cse45 (<= 0 |#StackHeapBarrier|) .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= 5 ~globalFive~0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse10 .cse11 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse14 .cse15 .cse16 .cse19 (<= |#NULL.offset| 0) .cse20 .cse21 .cse22 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) .cse28 .cse57 .cse29 (<= |#NULL.base| 0) .cse31 .cse32 .cse33 .cse58 .cse35 (<= 0 ~globalArgv~0.offset) .cse36 .cse52 .cse39 .cse40 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse41) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse54 (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse43 .cse44 .cse46 .cse47 .cse48 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse59 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse60 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse41 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse57 .cse29 .cse31 .cse32 .cse33 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 .cse61 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse41) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse59 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse60 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse52 .cse61 .cse42 .cse54 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse59 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse60 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse41) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse30 .cse31 .cse32 .cse33 .cse35 .cse56 .cse36 .cse37 .cse38 .cse61 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse41) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 06:48:47,229 INFO L899 garLoopResultBuilder]: For program point L1624-1(line 1624) no Hoare annotation was computed. [2022-11-19 06:48:47,229 INFO L899 garLoopResultBuilder]: For program point L1624-2(lines 1624 1631) no Hoare annotation was computed. [2022-11-19 06:48:47,231 INFO L895 garLoopResultBuilder]: At program point L1624-3(lines 1624 1631) the Hoare annotation is: (let ((.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse53 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse38 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse52 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse56 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse32 (= ~globalArgv~0.base 0)) (.cse57 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse58 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse61 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse17 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse62 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse31 (store ((as const (Array Int Int)) 0) 0 0)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse59 (<= 0 ~globalArgv~0.base)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse60 (<= ~globalArgv~0.base 0)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse37 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse31) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse31) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse24 .cse53 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse37 .cse39 .cse40 .cse41 .cse54 .cse43 .cse55 .cse56 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse1 (<= 0 |ULTIMATE.start_goodB2G1_~result~0#1|) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse18 .cse53 .cse32 .cse40 .cse41 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse43 .cse55 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse31) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse31 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse53 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse55 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= 5 ~globalFive~0) .cse4 .cse5 .cse6 .cse7 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse8 .cse10 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse13 .cse14 .cse15 .cse19 (<= |#NULL.offset| 0) .cse20 .cse21 .cse23 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) .cse29 .cse59 .cse30 (<= |#NULL.base| 0) .cse33 .cse34 .cse35 .cse60 .cse37 (<= 0 ~globalArgv~0.offset) .cse39 .cse54 .cse57 .cse58 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse31) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse56 (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse44 .cse45 .cse47 .cse48 .cse49 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse31) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse37 .cse39 .cse40 .cse41 .cse54 .cse42 .cse43 .cse56 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse62 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse39 .cse40 .cse41 .cse57 .cse58 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse31) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse62 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse31 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse59 .cse30 .cse33 .cse34 .cse35 .cse60 .cse63 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 06:48:47,231 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-19 06:48:47,231 INFO L899 garLoopResultBuilder]: For program point L1649-1(lines 1649 1656) no Hoare annotation was computed. [2022-11-19 06:48:47,231 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 1657) no Hoare annotation was computed. [2022-11-19 06:48:47,231 INFO L899 garLoopResultBuilder]: For program point L1608(lines 1608 1616) no Hoare annotation was computed. [2022-11-19 06:48:47,232 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse41 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-19 06:48:47,232 INFO L899 garLoopResultBuilder]: For program point L1600-1(lines 1594 1601) no Hoare annotation was computed. [2022-11-19 06:48:47,232 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-19 06:48:47,232 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2022-11-19 06:48:47,233 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1638) no Hoare annotation was computed. [2022-11-19 06:48:47,233 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-19 06:48:47,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-11-19 06:48:47,233 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-11-19 06:48:47,233 INFO L899 garLoopResultBuilder]: For program point L1651(lines 1651 1655) no Hoare annotation was computed. [2022-11-19 06:48:47,234 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,234 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-19 06:48:47,234 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-19 06:48:47,235 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| Int)) (and (not (= 11 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) (store ((as const (Array Int Int)) 0) 0 0)) (not (= 3 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 4 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 10 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| 0)) (not (= 9 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 8 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 14) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 0))) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,235 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-11-19 06:48:47,235 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741822) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 1 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| Int)) (and (not (= 11 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) (store ((as const (Array Int Int)) 0) 0 0)) (not (= 3 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 4 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 10 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14| 0)) (not (= 9 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (not (= 8 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 14) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_14|) 0))) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,235 INFO L899 garLoopResultBuilder]: For program point L1610-1(line 1610) no Hoare annotation was computed. [2022-11-19 06:48:47,236 INFO L895 garLoopResultBuilder]: At program point L1668(line 1668) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,236 INFO L899 garLoopResultBuilder]: For program point L1668-1(line 1668) no Hoare annotation was computed. [2022-11-19 06:48:47,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:48:47,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-11-19 06:48:47,237 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1601) no Hoare annotation was computed. [2022-11-19 06:48:47,237 INFO L899 garLoopResultBuilder]: For program point L1586(lines 1586 1619) no Hoare annotation was computed. [2022-11-19 06:48:47,237 INFO L895 garLoopResultBuilder]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse43 (<= 1 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse45 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 1073741822)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse37 (= ~globalArgc~0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse19) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse28 .cse29 .cse30 .cse31 .cse32 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 .cse37 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse46 .cse47))) [2022-11-19 06:48:47,238 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-19 06:48:47,238 INFO L899 garLoopResultBuilder]: For program point L1636-1(line 1636) no Hoare annotation was computed. [2022-11-19 06:48:47,238 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-11-19 06:48:47,238 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:48:47,239 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:48:47,239 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-11-19 06:48:47,239 INFO L899 garLoopResultBuilder]: For program point L1620(lines 1620 1640) no Hoare annotation was computed. [2022-11-19 06:48:47,239 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-11-19 06:48:47,240 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (let ((.cse24 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse42 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse43 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse58 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse59 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse54 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse55 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse60 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse15 (= (select |#valid| 7) 1)) (.cse61 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse56 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse23 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (<= 4 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse62 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse41 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (<= |ULTIMATE.start_goodG2B1_~result~2#1| 4)) (.cse48 (= (select |#valid| 10) 1)) (.cse49 (= (select |#valid| 8) 1)) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse56 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse57 .cse36 .cse37 .cse38 .cse39 .cse58 .cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse8 .cse9 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse12 .cse13 .cse15 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .cse17 (<= |#NULL.offset| 0) .cse18 .cse19 .cse21 .cse22 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse23 .cse25 .cse26 .cse27 .cse28 (<= 0 ~globalFalse~0) .cse29 (<= 0 ~globalArgv~0.base) .cse30 .cse32 .cse33 .cse34 .cse35 (<= ~globalArgv~0.base 0) (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2) .cse36 (<= 0 ~globalArgv~0.offset) .cse37 .cse40 .cse58 .cse59 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse43 (<= 0 |#NULL.offset|) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse1 (<= 0 |ULTIMATE.start_goodB2G1_~result~0#1|) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse10 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse11 .cse14 .cse16 .cse22 .cse24 .cse31 .cse33 .cse38 .cse39 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse41 .cse42 .cse46 .cse47 (<= 0 |#StackHeapBarrier|) .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse60 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse61 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse20) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse39 .cse58 .cse59 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse60 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse61 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse20) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse39 .cse62 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse60 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse61 .cse56 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse57 .cse36 .cse37 .cse38 .cse39 .cse62 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52))) [2022-11-19 06:48:47,241 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-11-19 06:48:47,242 INFO L895 garLoopResultBuilder]: At program point L1645-4(lines 1645 1648) the Hoare annotation is: (let ((.cse4 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse17 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse40 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse58 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse59 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse62 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse57 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse42 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse16 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse60 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse54 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (<= 4 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse61 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse43 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse44 (= ~globalArgc~0 0)) (.cse55 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (<= |ULTIMATE.start_goodG2B1_~result~2#1| 4)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= (select |#valid| 8) 1)) (.cse51 (< 0 |#StackHeapBarrier|)) (.cse52 (= |#NULL.base| 0)) (.cse53 (= ~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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse42) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse1 (<= 0 |ULTIMATE.start_goodB2G1_~result~0#1|) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse15 .cse18 .cse54 .cse30 .cse32 .cse38 .cse39 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse43 .cse44 .cse55 .cse47 .cse48 (<= 0 |#StackHeapBarrier|) .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse42) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse54 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse56 .cse43 .cse44 .cse55 .cse57 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse9 .cse10 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse13 .cse14 .cse16 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .cse19 (<= |#NULL.offset| 0) .cse20 .cse21 .cse22 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 ~globalFalse~0) .cse28 (<= 0 ~globalArgv~0.base) .cse29 .cse31 .cse32 .cse33 .cse34 (<= ~globalArgv~0.base 0) (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2) .cse36 (<= 0 ~globalArgv~0.offset) .cse37 .cse56 .cse40 .cse41 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse42) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse57 (<= 0 |#NULL.offset|) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse58 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse59 .cse18 .cse19 .cse20 .cse21 .cse60 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse42) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse61 .cse37 .cse38 .cse39 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse58 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse59 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse42 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse42) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse60 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse61 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse42) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse58 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse59 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse56 .cse43 .cse62 .cse44 .cse57 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse42 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse60 .cse22 .cse23 .cse54 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse61 .cse37 .cse38 .cse39 .cse43 .cse44 .cse55 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53))) [2022-11-19 06:48:47,243 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-19 06:48:47,243 INFO L902 garLoopResultBuilder]: At program point L1670(line 1670) the Hoare annotation is: true [2022-11-19 06:48:47,244 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: (let ((.cse10 (<= ~globalFalse~0 0)) (.cse17 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse20 (<= |#NULL.offset| 0)) (.cse29 (<= 0 ~globalFalse~0)) (.cse31 (<= 0 ~globalArgv~0.base)) (.cse36 (<= ~globalArgv~0.base 0)) (.cse37 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse46 (<= 0 |#NULL.offset|)) (.cse62 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse66 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse55 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse59 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse41 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse45 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse61 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse56 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse16 (= (select |#valid| 7) 1)) (.cse57 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse67 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse44 (store ((as const (Array Int Int)) 0) 0 0)) (.cse63 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse68 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse39 (= (select |#valid| 2) 1)) (.cse64 (= |#NULL.offset| 0)) (.cse65 (= ~globalFalse~0 0)) (.cse60 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse43 (= ~globalArgc~0 0)) (.cse47 (= (select |#valid| 6) 1)) (.cse48 (= (select |#length| 8) 54)) (.cse49 (= 5 ~globalFive~0)) (.cse50 (= (select |#valid| 10) 1)) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse53 (= |#NULL.base| 0)) (.cse54 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse44) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse8 .cse56 .cse9 .cse10 (<= ~GLOBAL_CONST_FIVE~0 5) .cse13 .cse14 .cse15 .cse16 .cse57 .cse17 .cse58 .cse19 .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|) 14) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_15|))) .cse23 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse59 .cse37 .cse38 (<= 0 ~globalArgv~0.offset) .cse39 .cse60 .cse43 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse24 .cse62 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 .cse63 .cse33 .cse34 .cse35 .cse38 .cse39 .cse64 .cse65 .cse40 .cse43 .cse66 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse44) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse67 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 .cse63 .cse33 .cse34 .cse35 .cse38 .cse68 .cse39 .cse64 .cse65 .cse41 .cse42 .cse43 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse1 (<= 0 |ULTIMATE.start_goodB2G1_~result~0#1|) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse15 .cse18 .cse62 .cse63 .cse64 .cse65 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse43 .cse66 .cse49 (<= 0 |#StackHeapBarrier|) .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 .cse67 .cse23 .cse24 .cse62 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 .cse63 .cse33 .cse34 .cse35 .cse38 .cse68 .cse39 .cse64 .cse65 .cse43 .cse66 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse58 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 .cse63 .cse33 .cse34 .cse35 .cse59 .cse38 .cse39 .cse64 .cse65 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 11)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 10)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) 0) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_14| 4)))) .cse43 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse56 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse57 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 .cse63 .cse33 .cse34 .cse35 .cse38 .cse39 .cse64 .cse65 .cse40 .cse60 .cse43 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse61 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse56 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse57 .cse18 .cse19 .cse21 .cse22 .cse67 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse32 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| Int)) (and (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) .cse44) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|) 0) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_13|)))) .cse63 .cse33 .cse34 .cse35 .cse38 .cse68 .cse39 .cse64 .cse65 .cse60 .cse43 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54))) [2022-11-19 06:48:47,244 INFO L902 garLoopResultBuilder]: At program point L1670-1(line 1670) the Hoare annotation is: true [2022-11-19 06:48:47,244 INFO L899 garLoopResultBuilder]: For program point L1604(line 1604) no Hoare annotation was computed. [2022-11-19 06:48:47,245 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1604 1618) no Hoare annotation was computed. [2022-11-19 06:48:47,245 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-19 06:48:47,245 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-19 06:48:47,248 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:47,250 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:48:47,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:48:47 BoogieIcfgContainer [2022-11-19 06:48:47,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:48:47,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:48:47,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:48:47,259 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:48:47,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:43:04" (3/4) ... [2022-11-19 06:48:47,262 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:48:47,268 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 06:48:47,268 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-19 06:48:47,268 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 06:48:47,268 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-19 06:48:47,273 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 06:48:47,273 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-19 06:48:47,274 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 06:48:47,274 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:48:47,274 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:48:47,318 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:48:47,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:48:47,319 INFO L158 Benchmark]: Toolchain (without parser) took 345008.93ms. Allocated memory was 136.3MB in the beginning and 528.5MB in the end (delta: 392.2MB). Free memory was 101.4MB in the beginning and 464.0MB in the end (delta: -362.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,319 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:48:47,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1167.04ms. Allocated memory is still 136.3MB. Free memory was 101.1MB in the beginning and 59.7MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.35ms. Allocated memory is still 136.3MB. Free memory was 59.7MB in the beginning and 56.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,320 INFO L158 Benchmark]: Boogie Preprocessor took 59.78ms. Allocated memory is still 136.3MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,320 INFO L158 Benchmark]: RCFGBuilder took 685.36ms. Allocated memory is still 136.3MB. Free memory was 54.1MB in the beginning and 99.7MB in the end (delta: -45.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,320 INFO L158 Benchmark]: TraceAbstraction took 342927.33ms. Allocated memory was 136.3MB in the beginning and 528.5MB in the end (delta: 392.2MB). Free memory was 99.5MB in the beginning and 468.2MB in the end (delta: -368.7MB). Peak memory consumption was 325.5MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,320 INFO L158 Benchmark]: Witness Printer took 59.54ms. Allocated memory is still 528.5MB. Free memory was 468.2MB in the beginning and 464.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 06:48:47,321 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.14ms. Allocated memory is still 92.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1167.04ms. Allocated memory is still 136.3MB. Free memory was 101.1MB in the beginning and 59.7MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.35ms. Allocated memory is still 136.3MB. Free memory was 59.7MB in the beginning and 56.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.78ms. Allocated memory is still 136.3MB. Free memory was 56.2MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 685.36ms. Allocated memory is still 136.3MB. Free memory was 54.1MB in the beginning and 99.7MB in the end (delta: -45.5MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 342927.33ms. Allocated memory was 136.3MB in the beginning and 528.5MB in the end (delta: 392.2MB). Free memory was 99.5MB in the beginning and 468.2MB in the end (delta: -368.7MB). Peak memory consumption was 325.5MB. Max. memory is 16.1GB. * Witness Printer took 59.54ms. Allocated memory is still 528.5MB. Free memory was 468.2MB in the beginning and 464.0MB 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: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 342.9s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 510 mSDsluCounter, 7438 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3658 IncrementalHoareTripleChecker+Unchecked, 5367 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1832 IncrementalHoareTripleChecker+Invalid, 5560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 2071 mSDtfsCounter, 1832 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2706 GetRequests, 2117 SyntacticMatches, 110 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6563 ImplicationChecksByTransitivity, 185.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=23, InterpolantAutomatonStates: 442, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 248 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 191 PreInvPairs, 274 NumberOfFragments, 17206 HoareAnnotationTreeSize, 191 FomulaSimplifications, 3657 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 25 FomulaSimplificationsInter, 38380 FormulaSimplificationTreeSizeReductionInter, 43.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2591 NumberOfCodeBlocks, 2591 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3283 ConstructedInterpolants, 0 QuantifiedInterpolants, 4042 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5093 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 57 InterpolantComputations, 16 PerfectInterpolantSequences, 1588/1638 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: 96.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 55, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 667, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 459, TOOLS_POST_TIME: 35.3s, TOOLS_POST_CALL_APPLICATIONS: 378, TOOLS_POST_CALL_TIME: 37.6s, TOOLS_POST_RETURN_APPLICATIONS: 252, TOOLS_POST_RETURN_TIME: 14.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1089, TOOLS_QUANTIFIERELIM_TIME: 86.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1576, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 334, DOMAIN_JOIN_TIME: 6.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 667, DOMAIN_ISBOTTOM_TIME: 1.9s, 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: 252, CALL_SUMMARIZER_CACHE_MISSES: 44, 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.3s, DAG_COMPRESSION_PROCESSED_NODES: 22497, DAG_COMPRESSION_RETAINED_NODES: 1609, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1670]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-19 06:48:47,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9d3ca39-9f4c-406e-8d5d-4df6e5bae1de/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE