./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_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_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/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_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/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_b6034a7c-3d80-448e-bf9c-d504cc88faed/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 66e3a7f896fa5340787a3c37b6c0ca2547060e04edd72a371311e7e68cf26523 --- 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 08:16:55,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:16:55,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:16:56,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:16:56,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:16:56,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:16:56,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:16:56,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:16:56,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:16:56,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:16:56,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:16:56,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:16:56,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:16:56,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:16:56,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:16:56,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:16:56,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:16:56,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:16:56,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:16:56,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:16:56,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:16:56,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:16:56,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:16:56,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:16:56,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:16:56,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:16:56,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:16:56,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:16:56,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:16:56,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:16:56,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:16:56,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:16:56,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:16:56,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:16:56,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:16:56,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:16:56,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:16:56,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:16:56,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:16:56,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:16:56,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:16:56,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 08:16:56,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:16:56,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:16:56,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:16:56,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:16:56,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:16:56,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:16:56,138 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:16:56,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:16:56,139 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:16:56,139 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:16:56,140 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:16:56,140 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:16:56,141 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:16:56,141 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:16:56,141 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:16:56,141 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:16:56,141 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:16:56,142 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:16:56,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:16:56,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:16:56,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:16:56,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:16:56,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:16:56,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:16:56,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:16:56,145 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 08:16:56,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:16:56,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:16:56,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:16:56,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:16:56,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:16:56,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:16:56,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:16:56,147 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:16:56,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:16:56,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:16:56,148 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:16:56,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:16:56,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:16:56,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:16:56,148 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_b6034a7c-3d80-448e-bf9c-d504cc88faed/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_b6034a7c-3d80-448e-bf9c-d504cc88faed/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 -> 66e3a7f896fa5340787a3c37b6c0ca2547060e04edd72a371311e7e68cf26523 [2022-11-19 08:16:56,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:16:56,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:16:56,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:16:56,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:16:56,492 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:16:56,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-19 08:16:56,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/data/5cbecb053/c6f3d59a72e542879a011db726095033/FLAGe80d2038f [2022-11-19 08:16:57,233 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:16:57,243 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-19 08:16:57,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/data/5cbecb053/c6f3d59a72e542879a011db726095033/FLAGe80d2038f [2022-11-19 08:16:57,440 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/data/5cbecb053/c6f3d59a72e542879a011db726095033 [2022-11-19 08:16:57,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:16:57,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:16:57,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:16:57,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:16:57,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:16:57,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:16:57" (1/1) ... [2022-11-19 08:16:57,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcf325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:57, skipping insertion in model container [2022-11-19 08:16:57,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:16:57" (1/1) ... [2022-11-19 08:16:57,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:16:57,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:16:58,115 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 08:16:58,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:16:58,683 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:16:58,714 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 08:16:58,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:16:58,973 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:16:58,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58 WrapperNode [2022-11-19 08:16:58,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:16:58,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:16:58,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:16:58,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:16:58,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,070 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2022-11-19 08:16:59,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:16:59,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:16:59,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:16:59,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:16:59,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,127 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:16:59,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:16:59,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:16:59,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:16:59,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (1/1) ... [2022-11-19 08:16:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:16:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:59,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:16:59,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:16:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 08:16:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 08:16:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 08:16:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 08:16:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 08:16:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-19 08:16:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-19 08:16:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:16:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 08:16:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:16:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:16:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:16:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:16:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-19 08:16:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-19 08:16:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 08:16:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:16:59,504 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:16:59,506 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:16:59,711 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:16:59,780 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:16:59,780 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:16:59,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:16:59 BoogieIcfgContainer [2022-11-19 08:16:59,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:16:59,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:16:59,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:16:59,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:16:59,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:16:57" (1/3) ... [2022-11-19 08:16:59,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d9964c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:16:59, skipping insertion in model container [2022-11-19 08:16:59,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:16:58" (2/3) ... [2022-11-19 08:16:59,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d9964c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:16:59, skipping insertion in model container [2022-11-19 08:16:59,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:16:59" (3/3) ... [2022-11-19 08:16:59,794 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-19 08:16:59,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:16:59,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 08:16:59,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:16:59,894 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;@2a35a40d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:16:59,905 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 08:16:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 08:16:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:16:59,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:59,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:59,922 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 08:16:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:59,929 INFO L85 PathProgramCache]: Analyzing trace with hash 63524263, now seen corresponding path program 1 times [2022-11-19 08:16:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:16:59,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521025477] [2022-11-19 08:16:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:00,333 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 08:17:00,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:00,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521025477] [2022-11-19 08:17:00,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521025477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:00,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:00,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:17:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317247368] [2022-11-19 08:17:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:00,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:17:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:17:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:17:00,394 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:17:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:00,533 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-19 08:17:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:17:00,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-19 08:17:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:00,547 INFO L225 Difference]: With dead ends: 137 [2022-11-19 08:17:00,548 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 08:17:00,552 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 08:17:00,556 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:00,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:17:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 08:17:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 08:17:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 08:17:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-19 08:17:00,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-19 08:17:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:00,613 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-19 08:17:00,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:17:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-19 08:17:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:17:00,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:00,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:00,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:17:00,617 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 08:17:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 182324300, now seen corresponding path program 1 times [2022-11-19 08:17:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:00,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598961873] [2022-11-19 08:17:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:00,820 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 08:17:00,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:00,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598961873] [2022-11-19 08:17:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598961873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:17:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492797443] [2022-11-19 08:17:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:00,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:00,824 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:17:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:00,864 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-11-19 08:17:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-11-19 08:17:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:00,866 INFO L225 Difference]: With dead ends: 68 [2022-11-19 08:17:00,866 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 08:17:00,867 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 08:17:00,868 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 97 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 08:17:00,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 97 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 08:17:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-19 08:17:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 08:17:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-11-19 08:17:00,884 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-11-19 08:17:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:00,885 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-11-19 08:17:00,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:17:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-11-19 08:17:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:17:00,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:00,886 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 08:17:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:17:00,887 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 08:17:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1357086081, now seen corresponding path program 1 times [2022-11-19 08:17:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:00,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728997519] [2022-11-19 08:17:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:00,947 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 08:17:00,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:00,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728997519] [2022-11-19 08:17:00,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728997519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:00,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:00,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:17:00,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86035486] [2022-11-19 08:17:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:00,951 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 08:17:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:01,027 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2022-11-19 08:17:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:01,028 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 08:17:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:01,030 INFO L225 Difference]: With dead ends: 162 [2022-11-19 08:17:01,030 INFO L226 Difference]: Without dead ends: 112 [2022-11-19 08:17:01,031 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 08:17:01,033 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:01,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-19 08:17:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2022-11-19 08:17:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 54 states have internal predecessors, (57), 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 08:17:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-11-19 08:17:01,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 20 [2022-11-19 08:17:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:01,054 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-11-19 08:17:01,054 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 08:17:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-11-19 08:17:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 08:17:01,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:01,056 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:01,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:17:01,057 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 08:17:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -88191861, now seen corresponding path program 1 times [2022-11-19 08:17:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937205979] [2022-11-19 08:17:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:17:01,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937205979] [2022-11-19 08:17:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937205979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:01,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:17:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506245267] [2022-11-19 08:17:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:01,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:17:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:01,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:17:01,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:17:01,198 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:01,281 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2022-11-19 08:17:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:17:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-11-19 08:17:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:01,283 INFO L225 Difference]: With dead ends: 119 [2022-11-19 08:17:01,284 INFO L226 Difference]: Without dead ends: 70 [2022-11-19 08:17:01,285 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 08:17:01,286 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:01,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:17:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-19 08:17:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-19 08:17:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 53 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 08:17:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-19 08:17:01,319 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2022-11-19 08:17:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:01,321 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-19 08:17:01,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-19 08:17:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 08:17:01,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:01,324 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:01,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:17:01,324 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 08:17:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 98416322, now seen corresponding path program 1 times [2022-11-19 08:17:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:01,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293753444] [2022-11-19 08:17:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:17:01,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:01,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293753444] [2022-11-19 08:17:01,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293753444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:01,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012216353] [2022-11-19 08:17:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:01,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:01,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:01,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:17:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:01,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:17:01,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:17:01,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:01,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012216353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:01,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:01,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 08:17:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692206385] [2022-11-19 08:17:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:01,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:01,851 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:01,932 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-11-19 08:17:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-19 08:17:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:01,940 INFO L225 Difference]: With dead ends: 102 [2022-11-19 08:17:01,941 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 08:17:01,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 08:17:01,945 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:01,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 08:17:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-11-19 08:17:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 57 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-11-19 08:17:01,972 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 34 [2022-11-19 08:17:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:01,974 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-11-19 08:17:01,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-11-19 08:17:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:17:01,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:01,983 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:01,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:02,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:02,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 08:17:02,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1244061203, now seen corresponding path program 1 times [2022-11-19 08:17:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:02,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057082879] [2022-11-19 08:17:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:02,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:17:02,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:02,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057082879] [2022-11-19 08:17:02,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057082879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:02,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296092524] [2022-11-19 08:17:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:02,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:02,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:17:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:02,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:17:02,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:17:02,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:02,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296092524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:02,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:02,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 08:17:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492468782] [2022-11-19 08:17:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:02,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:02,599 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:02,677 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-11-19 08:17:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2022-11-19 08:17:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:02,687 INFO L225 Difference]: With dead ends: 134 [2022-11-19 08:17:02,688 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 08:17:02,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 08:17:02,690 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 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 08:17:02,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 08:17:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2022-11-19 08:17:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-11-19 08:17:02,720 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 35 [2022-11-19 08:17:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:02,720 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-11-19 08:17:02,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-11-19 08:17:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 08:17:02,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:02,722 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:02,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:02,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:02,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:17:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1341109177, now seen corresponding path program 1 times [2022-11-19 08:17:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428810255] [2022-11-19 08:17:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:17:03,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428810255] [2022-11-19 08:17:03,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428810255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:03,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:03,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:17:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121832885] [2022-11-19 08:17:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:03,025 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:03,054 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-11-19 08:17:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-11-19 08:17:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:03,056 INFO L225 Difference]: With dead ends: 77 [2022-11-19 08:17:03,056 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 08:17:03,056 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 08:17:03,057 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 108 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 08:17:03,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 08:17:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-19 08:17:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2708333333333333) 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), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-19 08:17:03,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 36 [2022-11-19 08:17:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:03,071 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-19 08:17:03,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-19 08:17:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 08:17:03,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:03,072 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:17:03,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:17:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1375288584, now seen corresponding path program 1 times [2022-11-19 08:17:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081740720] [2022-11-19 08:17:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 08:17:03,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081740720] [2022-11-19 08:17:03,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081740720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:03,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:03,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:17:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643565272] [2022-11-19 08:17:03,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:17:03,132 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 08:17:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:03,164 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2022-11-19 08:17:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2022-11-19 08:17:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:03,165 INFO L225 Difference]: With dead ends: 99 [2022-11-19 08:17:03,166 INFO L226 Difference]: Without dead ends: 98 [2022-11-19 08:17:03,166 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 08:17:03,167 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:03,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 165 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-19 08:17:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2022-11-19 08:17:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 54 states have internal predecessors, (58), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-11-19 08:17:03,179 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2022-11-19 08:17:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:03,179 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-11-19 08:17:03,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 08:17:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-11-19 08:17:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 08:17:03,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:03,181 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] [2022-11-19 08:17:03,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:17:03,182 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:17:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1961623989, now seen corresponding path program 1 times [2022-11-19 08:17:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:03,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467203238] [2022-11-19 08:17:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:03,265 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 08:17:03,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467203238] [2022-11-19 08:17:03,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467203238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:03,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218856203] [2022-11-19 08:17:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:03,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:03,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:03,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:03,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:17:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:03,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:17:03,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:03,478 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 08:17:03,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218856203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:03,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:03,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 08:17:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193427064] [2022-11-19 08:17:03,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:03,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:03,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:03,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:03,482 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 08:17:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:03,526 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-11-19 08:17:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:03,526 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), 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 44 [2022-11-19 08:17:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:03,532 INFO L225 Difference]: With dead ends: 90 [2022-11-19 08:17:03,532 INFO L226 Difference]: Without dead ends: 89 [2022-11-19 08:17:03,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:03,535 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:03,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-19 08:17:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-11-19 08:17:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 08:17:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-11-19 08:17:03,567 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 44 [2022-11-19 08:17:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:03,568 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-19 08:17:03,568 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), 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 08:17:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-11-19 08:17:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 08:17:03,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:03,570 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] [2022-11-19 08:17:03,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:03,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:03,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:17:03,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash 680801653, now seen corresponding path program 1 times [2022-11-19 08:17:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178502562] [2022-11-19 08:17:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:03,888 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 08:17:03,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178502562] [2022-11-19 08:17:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178502562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112964310] [2022-11-19 08:17:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:03,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:03,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:03,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:17:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:04,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:17:04,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:04,078 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 08:17:04,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112964310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:04,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 08:17:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553735954] [2022-11-19 08:17:04,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:04,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:04,082 INFO L87 Difference]: Start difference. First operand 77 states and 102 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, (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 08:17:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:04,113 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-11-19 08:17:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:04,114 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, (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 45 [2022-11-19 08:17:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:04,115 INFO L225 Difference]: With dead ends: 77 [2022-11-19 08:17:04,116 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 08:17:04,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 08:17:04,117 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:04,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 08:17:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-19 08:17:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 08:17:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-11-19 08:17:04,130 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 45 [2022-11-19 08:17:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:04,131 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-11-19 08:17:04,131 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, (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 08:17:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-11-19 08:17:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-19 08:17:04,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:04,132 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:04,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-19 08:17:04,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:17:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash 193385579, now seen corresponding path program 1 times [2022-11-19 08:17:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:04,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630212970] [2022-11-19 08:17:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 08:17:04,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630212970] [2022-11-19 08:17:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630212970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59073212] [2022-11-19 08:17:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:04,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:04,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:17:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:04,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:17:04,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 08:17:04,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:04,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59073212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:04,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:04,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 08:17:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785777854] [2022-11-19 08:17:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:04,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:17:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:17:04,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:17:04,590 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 08:17:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:04,630 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-11-19 08:17:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:17:04,630 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 47 [2022-11-19 08:17:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:04,632 INFO L225 Difference]: With dead ends: 76 [2022-11-19 08:17:04,632 INFO L226 Difference]: Without dead ends: 75 [2022-11-19 08:17:04,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 08:17:04,633 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:04,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-19 08:17:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-11-19 08:17:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 52 states have internal predecessors, (56), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-11-19 08:17:04,651 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 47 [2022-11-19 08:17:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:04,652 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-11-19 08:17:04,652 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 08:17:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-11-19 08:17:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 08:17:04,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:04,653 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] [2022-11-19 08:17:04,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:04,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 08:17:04,866 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 08:17:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1213882814, now seen corresponding path program 1 times [2022-11-19 08:17:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:04,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667173247] [2022-11-19 08:17:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 08:17:04,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667173247] [2022-11-19 08:17:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667173247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752045636] [2022-11-19 08:17:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:04,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:04,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:17:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:05,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:17:05,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 08:17:05,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:05,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752045636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:05,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:05,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 08:17:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482041985] [2022-11-19 08:17:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:05,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:17:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:17:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:17:05,134 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 08:17:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:05,216 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-11-19 08:17:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:17:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 54 [2022-11-19 08:17:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:05,221 INFO L225 Difference]: With dead ends: 107 [2022-11-19 08:17:05,222 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 08:17:05,222 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 08:17:05,223 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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 08:17:05,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 08:17:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 08:17:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-19 08:17:05,242 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 54 [2022-11-19 08:17:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:05,242 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-19 08:17:05,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 08:17:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-11-19 08:17:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-19 08:17:05,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:05,244 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] [2022-11-19 08:17:05,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:05,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:05,451 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 08:17:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2011693763, now seen corresponding path program 1 times [2022-11-19 08:17:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:05,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012652949] [2022-11-19 08:17:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 08:17:05,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012652949] [2022-11-19 08:17:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012652949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874417370] [2022-11-19 08:17:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:05,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:05,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:05,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:05,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:17:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:05,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:17:05,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:17:05,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:05,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874417370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:05,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:05,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 08:17:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766676249] [2022-11-19 08:17:05,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:05,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:17:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:17:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:17:05,764 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 08:17:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:05,806 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-11-19 08:17:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:17:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 56 [2022-11-19 08:17:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:05,808 INFO L225 Difference]: With dead ends: 100 [2022-11-19 08:17:05,808 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 08:17:05,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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 08:17:05,809 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 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 08:17:05,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 08:17:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 08:17:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 51 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-11-19 08:17:05,820 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 56 [2022-11-19 08:17:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:05,820 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-11-19 08:17:05,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 08:17:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-11-19 08:17:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 08:17:05,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:05,821 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:05,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:06,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 08:17:06,028 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 08:17:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash -227559506, now seen corresponding path program 1 times [2022-11-19 08:17:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015113215] [2022-11-19 08:17:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 08:17:06,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015113215] [2022-11-19 08:17:06,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015113215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552036828] [2022-11-19 08:17:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:06,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:06,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:06,126 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:06,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:17:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:06,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:17:06,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 08:17:06,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:06,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552036828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:06,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:06,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 08:17:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810451119] [2022-11-19 08:17:06,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:06,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:17:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:17:06,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:17:06,306 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 08:17:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:06,349 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-11-19 08:17:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:17:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-11-19 08:17:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:06,351 INFO L225 Difference]: With dead ends: 83 [2022-11-19 08:17:06,351 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 08:17:06,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:17:06,352 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 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 08:17:06,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:17:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 08:17:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 08:17:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 08:17:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-11-19 08:17:06,362 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 60 [2022-11-19 08:17:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:06,363 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-11-19 08:17:06,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 08:17:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-11-19 08:17:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 08:17:06,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:06,364 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:06,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:06,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 08:17:06,571 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 08:17:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 639997850, now seen corresponding path program 1 times [2022-11-19 08:17:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:06,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058667992] [2022-11-19 08:17:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:06,734 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 08:17:06,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:06,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058667992] [2022-11-19 08:17:06,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058667992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:06,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791486138] [2022-11-19 08:17:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:06,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:06,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:06,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 08:17:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:06,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:17:06,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:06,932 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 08:17:06,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:07,051 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 08:17:07,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791486138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:07,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769244782] [2022-11-19 08:17:07,083 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-19 08:17:07,083 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:17:07,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:17:07,097 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:17:07,097 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:17:07,707 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 08:17:07,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:07,756 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 08:17:07,756 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 08:17:07,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:07,986 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 08:17:07,986 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 08:17:08,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:08,245 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:17:08,245 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 08:17:08,283 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 08:17:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:08,397 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 08:17:09,743 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 08:17:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:09,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:09,812 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:17:09,813 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 08:17:09,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:09,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:10,162 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 08:17:10,163 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 08:17:10,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:10,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:10,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:17:10,245 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 08:17:10,347 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 08:17:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:10,530 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 08:17:13,908 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:17:13,911 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-19 08:17:13,957 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 08:17:14,132 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 08:17:14,136 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:17:26,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [769244782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:26,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:26,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-11-19 08:17:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127798193] [2022-11-19 08:17:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:26,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 08:17:26,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 08:17:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 08:17:26,445 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:17:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:26,799 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-11-19 08:17:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-19 08:17:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-11-19 08:17:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:26,802 INFO L225 Difference]: With dead ends: 116 [2022-11-19 08:17:26,802 INFO L226 Difference]: Without dead ends: 115 [2022-11-19 08:17:26,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 08:17:26,807 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 29 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:26,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 419 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 326 Unchecked, 0.3s Time] [2022-11-19 08:17:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-19 08:17:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-11-19 08:17:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 75 states have internal predecessors, (80), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-19 08:17:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 138 transitions. [2022-11-19 08:17:26,845 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 138 transitions. Word has length 65 [2022-11-19 08:17:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:26,846 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 138 transitions. [2022-11-19 08:17:26,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:17:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 138 transitions. [2022-11-19 08:17:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 08:17:26,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:26,848 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:26,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:27,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 08:17:27,055 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 08:17:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1634902970, now seen corresponding path program 1 times [2022-11-19 08:17:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85230067] [2022-11-19 08:17:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:27,197 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 08:17:27,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:27,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85230067] [2022-11-19 08:17:27,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85230067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:27,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386651044] [2022-11-19 08:17:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:27,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:27,200 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:27,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:17:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:27,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:17:27,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:27,424 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 08:17:27,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:27,549 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 08:17:27,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386651044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546966361] [2022-11-19 08:17:27,553 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-19 08:17:27,553 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:17:27,554 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:17:27,554 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:17:27,554 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:17:27,822 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 08:17:27,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:28,046 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:17:28,046 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 08:17:28,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:28,105 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 08:17:28,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:28,127 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 08:17:28,154 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 08:17:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:28,297 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 08:17:29,192 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 08:17:29,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,242 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:17:29,242 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 08:17:29,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:17:29,317 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 08:17:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,383 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 08:17:29,384 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 08:17:29,432 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 08:17:29,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:29,652 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 08:17:29,653 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 08:17:39,782 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:17:39,785 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 199 for LOIs [2022-11-19 08:17:39,910 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 08:17:39,914 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 08:17:39,918 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:18:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [546966361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:18:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [4, 4, 4] total 40 [2022-11-19 08:18:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166086267] [2022-11-19 08:18:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:18:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:18:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:18:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 08:18:02,980 INFO L87 Difference]: Start difference. First operand 110 states and 138 transitions. Second operand has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:03,435 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2022-11-19 08:18:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-19 08:18:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 66 [2022-11-19 08:18:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:03,437 INFO L225 Difference]: With dead ends: 118 [2022-11-19 08:18:03,437 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 08:18:03,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 08:18:03,439 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 32 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 478 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:03,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 801 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 478 Unchecked, 0.4s Time] [2022-11-19 08:18:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 08:18:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-11-19 08:18:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 66 states have internal predecessors, (70), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 08:18:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-11-19 08:18:03,468 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 66 [2022-11-19 08:18:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:03,469 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-11-19 08:18:03,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-11-19 08:18:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 08:18:03,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:03,471 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:18:03,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:18:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 08:18:03,677 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 08:18:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -879376380, now seen corresponding path program 1 times [2022-11-19 08:18:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:03,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366580549] [2022-11-19 08:18:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-19 08:18:03,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366580549] [2022-11-19 08:18:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366580549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:18:03,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:18:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:18:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642547538] [2022-11-19 08:18:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:18:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:18:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:18:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:18:03,765 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-19 08:18:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:03,814 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2022-11-19 08:18:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:18:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 68 [2022-11-19 08:18:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:03,816 INFO L225 Difference]: With dead ends: 119 [2022-11-19 08:18:03,817 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 08:18:03,817 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 08:18:03,818 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 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 08:18:03,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:18:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 08:18:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-19 08:18:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 08:18:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2022-11-19 08:18:03,841 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 68 [2022-11-19 08:18:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:03,841 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2022-11-19 08:18:03,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-19 08:18:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2022-11-19 08:18:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:18:03,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:03,843 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:18:03,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 08:18:03,844 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 08:18:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1438476175, now seen corresponding path program 1 times [2022-11-19 08:18:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:03,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135635829] [2022-11-19 08:18:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:04,007 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 08:18:04,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135635829] [2022-11-19 08:18:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135635829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205153358] [2022-11-19 08:18:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:04,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:04,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:04,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:04,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 08:18:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:04,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:18:04,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:04,210 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 08:18:04,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:04,303 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 08:18:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205153358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:04,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [864675772] [2022-11-19 08:18:04,310 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 08:18:04,310 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:18:04,315 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:18:04,315 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:18:04,315 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:18:04,525 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 08:18:04,534 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 08:18:04,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:04,567 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 08:18:04,568 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 08:18:04,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:04,731 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 08:18:04,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 08:18:04,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:04,963 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:18:04,963 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 08:18:05,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:05,056 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 08:18:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:05,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:05,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:05,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:05,963 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:18:05,964 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 08:18:05,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:06,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:06,213 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 08:18:06,214 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 08:18:06,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:06,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:06,293 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:18:06,294 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 08:18:06,369 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 08:18:06,382 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 08:18:06,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:06,529 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 08:18:09,266 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:18:09,268 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 173 for LOIs [2022-11-19 08:18:09,407 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 08:18:09,533 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 08:18:09,666 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:18:26,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [864675772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:18:26,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:26,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-19 08:18:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655237116] [2022-11-19 08:18:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:18:26,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:18:26,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:26,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:18:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 08:18:26,854 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:27,547 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2022-11-19 08:18:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 08:18:27,548 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 08:18:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:27,549 INFO L225 Difference]: With dead ends: 119 [2022-11-19 08:18:27,549 INFO L226 Difference]: Without dead ends: 118 [2022-11-19 08:18:27,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=274, Invalid=1618, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 08:18:27,551 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 46 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 542 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:27,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 281 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 90 Invalid, 0 Unknown, 542 Unchecked, 0.3s Time] [2022-11-19 08:18:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-19 08:18:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-11-19 08:18:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 79 states have internal predecessors, (82), 27 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-19 08:18:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2022-11-19 08:18:27,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 67 [2022-11-19 08:18:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:27,592 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2022-11-19 08:18:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-11-19 08:18:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 08:18:27,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:27,595 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:18:27,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:18:27,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 08:18:27,795 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 08:18:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 149433891, now seen corresponding path program 1 times [2022-11-19 08:18:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:27,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038672344] [2022-11-19 08:18:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:27,908 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 08:18:27,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038672344] [2022-11-19 08:18:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038672344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494132662] [2022-11-19 08:18:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:27,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:27,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:18:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:28,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:18:28,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:28,112 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 08:18:28,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:28,187 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 08:18:28,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494132662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:28,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [150800973] [2022-11-19 08:18:28,194 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 08:18:28,194 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:18:28,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:18:28,196 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:18:28,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:18:28,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:28,634 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:18:28,634 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 08:18:28,661 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 08:18:28,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:28,692 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 08:18:28,706 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 08:18:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:28,722 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 08:18:28,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:28,801 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 08:18:29,699 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 08:18:29,710 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 08:18:29,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:29,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:29,755 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:18:29,756 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 08:18:29,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:29,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:30,033 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 08:18:30,034 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 08:18:30,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:30,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:30,091 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:18:30,091 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 08:18:30,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:30,257 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 08:18:32,971 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:18:32,973 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 205 for LOIs [2022-11-19 08:18:33,092 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 08:18:33,195 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 08:18:33,299 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:18:51,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [150800973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:18:51,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:18:51,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-19 08:18:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776710139] [2022-11-19 08:18:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:18:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:18:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:18:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:18:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 08:18:51,701 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:52,391 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2022-11-19 08:18:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 08:18:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 08:18:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:52,407 INFO L225 Difference]: With dead ends: 147 [2022-11-19 08:18:52,407 INFO L226 Difference]: Without dead ends: 146 [2022-11-19 08:18:52,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=276, Invalid=1616, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 08:18:52,409 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:52,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 372 Unchecked, 0.3s Time] [2022-11-19 08:18:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-19 08:18:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-11-19 08:18:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 91 states have (on average 1.065934065934066) internal successors, (97), 94 states have internal predecessors, (97), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-19 08:18:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2022-11-19 08:18:52,464 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 67 [2022-11-19 08:18:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:52,464 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2022-11-19 08:18:52,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:18:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2022-11-19 08:18:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 08:18:52,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:52,466 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:18:52,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-19 08:18:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:52,671 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:18:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1643088305, now seen corresponding path program 1 times [2022-11-19 08:18:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:18:52,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413198210] [2022-11-19 08:18:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:18:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:52,800 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 08:18:52,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413198210] [2022-11-19 08:18:52,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413198210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:52,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636027342] [2022-11-19 08:18:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:52,803 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:52,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:18:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:52,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:18:52,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:52,995 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 08:18:52,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 08:18:53,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636027342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:18:53,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242000066] [2022-11-19 08:18:53,088 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 08:18:53,088 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:18:53,089 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:18:53,089 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:18:53,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:18:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:53,331 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 08:18:53,331 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 08:18:53,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:53,485 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 08:18:53,486 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 08:18:53,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:53,705 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:18:53,705 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 08:18:53,738 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 08:18:53,751 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 08:18:53,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:53,822 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 08:18:54,551 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 08:18:54,562 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 08:18:54,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,618 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:18:54,619 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 08:18:54,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,698 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:18:54,699 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 08:18:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:54,853 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 08:18:54,853 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 08:18:55,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:55,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:55,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:55,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:18:55,099 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 08:18:55,099 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 08:18:56,069 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:18:56,070 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 67 for LOIs [2022-11-19 08:18:56,085 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 08:18:56,164 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 08:18:56,267 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:19:05,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1242000066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:19:05,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:05,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-19 08:19:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643039130] [2022-11-19 08:19:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:19:05,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:19:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:19:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 08:19:05,791 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:19:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:07,524 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-11-19 08:19:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 08:19:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 68 [2022-11-19 08:19:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:07,525 INFO L225 Difference]: With dead ends: 150 [2022-11-19 08:19:07,525 INFO L226 Difference]: Without dead ends: 102 [2022-11-19 08:19:07,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=235, Invalid=1745, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 08:19:07,527 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 49 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:07,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 377 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 547 Invalid, 0 Unknown, 171 Unchecked, 0.8s Time] [2022-11-19 08:19:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-19 08:19:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-19 08:19:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.064516129032258) internal successors, (66), 64 states have internal predecessors, (66), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 08:19:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-11-19 08:19:07,556 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 68 [2022-11-19 08:19:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:07,556 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-11-19 08:19:07,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:19:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-11-19 08:19:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 08:19:07,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:07,558 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:19:07,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:07,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:07,763 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 08:19:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 337483485, now seen corresponding path program 1 times [2022-11-19 08:19:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:07,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067508260] [2022-11-19 08:19:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:07,880 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 08:19:07,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:07,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067508260] [2022-11-19 08:19:07,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067508260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:07,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806716716] [2022-11-19 08:19:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:07,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:07,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 08:19:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:08,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:19:08,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:08,053 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 08:19:08,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:08,120 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 08:19:08,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806716716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:19:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65643851] [2022-11-19 08:19:08,123 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 08:19:08,123 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:19:08,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:19:08,123 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:19:08,123 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:19:08,328 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 08:19:08,335 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 08:19:08,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:08,491 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 08:19:08,492 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 08:19:08,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:08,558 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 08:19:08,558 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 08:19:08,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:08,798 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:19:08,798 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 08:19:08,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:08,891 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 08:19:09,767 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 08:19:09,777 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 08:19:09,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:09,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:09,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:09,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:09,815 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:19:09,815 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 08:19:09,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:09,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:10,067 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 08:19:10,067 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 08:19:10,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:10,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:10,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:10,129 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 08:19:10,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:10,289 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 08:19:12,887 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:19:12,889 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 205 for LOIs [2022-11-19 08:19:13,023 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 08:19:13,150 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 08:19:13,284 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:19:31,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [65643851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:19:31,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:31,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-19 08:19:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86220455] [2022-11-19 08:19:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:19:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:19:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:19:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1536, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 08:19:31,704 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:19:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:32,396 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-19 08:19:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 08:19:32,397 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), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 68 [2022-11-19 08:19:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:32,398 INFO L225 Difference]: With dead ends: 101 [2022-11-19 08:19:32,398 INFO L226 Difference]: Without dead ends: 77 [2022-11-19 08:19:32,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 08:19:32,400 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:32,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 214 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 83 Invalid, 0 Unknown, 492 Unchecked, 0.2s Time] [2022-11-19 08:19:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-19 08:19:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-11-19 08:19:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 08:19:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-19 08:19:32,425 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 68 [2022-11-19 08:19:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:32,426 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-19 08:19:32,426 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), 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 08:19:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-19 08:19:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 08:19:32,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:19:32,427 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 08:19:32,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 08:19:32,634 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 08:19:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:19:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -424038214, now seen corresponding path program 1 times [2022-11-19 08:19:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:19:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312721959] [2022-11-19 08:19:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:19:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:32,753 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 08:19:32,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:19:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312721959] [2022-11-19 08:19:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312721959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79333016] [2022-11-19 08:19:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:32,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:32,755 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:32,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 08:19:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:32,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:19:32,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:32,956 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 08:19:32,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:33,034 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 08:19:33,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79333016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:19:33,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [526461528] [2022-11-19 08:19:33,037 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 08:19:33,037 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:19:33,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:19:33,038 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:19:33,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:19:33,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:33,406 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 08:19:33,407 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 08:19:33,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:33,437 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 08:19:33,460 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 08:19:33,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:33,473 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 08:19:33,499 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 08:19:33,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:33,556 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 08:19:34,356 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 08:19:34,366 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 08:19:34,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,415 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 08:19:34,415 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 08:19:34,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,473 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:34,473 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 08:19:34,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,691 INFO L321 Elim1Store]: treesize reduction 144, result has 33.6 percent of original size [2022-11-19 08:19:34,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 83 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 16 case distinctions, treesize of input 77 treesize of output 145 [2022-11-19 08:19:34,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:34,933 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 08:19:34,934 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 153 treesize of output 201 [2022-11-19 08:19:35,971 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 08:19:35,973 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-19 08:19:35,977 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 08:19:36,048 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 08:19:36,059 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:19:44,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [526461528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:19:44,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:44,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-11-19 08:19:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035806177] [2022-11-19 08:19:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:19:44,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 08:19:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:19:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 08:19:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 08:19:44,912 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:19:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:19:47,056 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-19 08:19:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 08:19:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-11-19 08:19:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:19:47,059 INFO L225 Difference]: With dead ends: 74 [2022-11-19 08:19:47,059 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 08:19:47,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 161 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2022-11-19 08:19:47,061 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:19:47,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 98 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 626 Invalid, 0 Unknown, 170 Unchecked, 1.1s Time] [2022-11-19 08:19:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 08:19:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 08:19:47,062 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 08:19:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 08:19:47,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-19 08:19:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:19:47,063 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 08:19:47,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 states have internal predecessors, (37), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:19:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 08:19:47,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 08:19:47,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 08:19:47,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 08:19:47,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 08:19:47,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 08:19:47,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 08:19:47,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 08:19:47,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 08:19:47,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 08:19:47,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 08:19:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 08:19:47,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 08:20:11,865 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 08:20:11,865 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 08:20:11,866 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-19 08:20:11,866 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-19 08:20:11,866 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 08:20:11,866 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 08:20:11,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-19 08:20:11,866 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-19 08:20:11,867 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-19 08:20:11,867 INFO L902 garLoopResultBuilder]: At program point L1662-1(line 1662) the Hoare annotation is: true [2022-11-19 08:20:11,867 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-19 08:20:11,867 INFO L902 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: true [2022-11-19 08:20:11,867 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-19 08:20:11,868 INFO L895 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: (let ((.cse57 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse58 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse17 (<= .cse58 0)) (.cse44 (<= 0 .cse58)) (.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)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.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|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648))) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select |#length| 8) 48)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= 48 (select |#length| 5))) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse55 (<= 0 .cse57)) (.cse42 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse53 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse54 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse56 (<= .cse57 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (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|) .cse12) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse8 .cse11 .cse13 .cse18 .cse22 .cse24 .cse52 .cse31 .cse36 .cse40 .cse41 .cse42 .cse53 .cse43 .cse54 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse55 .cse42 .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|) .cse12) (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 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse52 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse55 .cse42 .cse53 .cse43 .cse54 .cse56 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-19 08:20:11,869 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-11-19 08:20:11,869 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-11-19 08:20:11,869 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2022-11-19 08:20:11,869 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2022-11-19 08:20:11,870 INFO L895 garLoopResultBuilder]: At program point L1638-4(lines 1638 1641) the Hoare annotation is: (let ((.cse57 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse58 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse17 (<= .cse58 0)) (.cse44 (<= 0 .cse58)) (.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)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse24 (= 16 (select |#length| 7))) (.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|)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648))) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select |#length| 8) 48)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= 48 (select |#length| 5))) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse55 (<= 0 .cse57)) (.cse42 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse53 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse54 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse56 (<= .cse57 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (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|) .cse12) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse8 .cse11 .cse13 .cse18 .cse22 .cse23 .cse52 .cse31 .cse36 .cse40 .cse41 .cse42 .cse53 .cse43 .cse54 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse55 .cse42 .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|) .cse12) (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 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse52 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse55 .cse42 .cse53 .cse43 .cse54 .cse56 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-19 08:20:11,871 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 08:20:11,872 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse56 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse57 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse1 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse30 (<= .cse57 0)) (.cse5 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse49 (<= 0 .cse57)) (.cse18 (= (select |#length| 9) 21)) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse19 (= (select |#length| 6) 1)) (.cse20 (= 1 (select |#valid| 5))) (.cse21 (= (select (select |#memory_int| 2) 0) 0)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse23 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse24 (= (select |#valid| 9) 1)) (.cse25 (= (select |#valid| 11) 1)) (.cse26 (= (select (select |#memory_int| 1) 0) 0)) (.cse2 (= ~globalArgv~0.offset 0)) (.cse3 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse50 (store ((as const (Array Int Int)) 0) 0 0)) (.cse27 (= (select |#valid| 3) 1)) (.cse28 (= 21 (select |#length| 4))) (.cse29 (= (select |#valid| 7) 1)) (.cse4 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse32 (= (select |#length| 10) 18)) (.cse33 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse34 (= 16 (select |#length| 7))) (.cse35 (= (select |#valid| 4) 1)) (.cse36 (= 16 (select |#length| 3))) (.cse37 (= (select |#length| 2) 1)) (.cse38 (= (select |#valid| 1) 1)) (.cse39 (= 16 (select |#length| 11))) (.cse40 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse6 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648))) (.cse7 (= ~globalArgv~0.base 0)) (.cse41 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse42 (= (select |#length| 8) 48)) (.cse43 (= (select (select |#memory_int| 6) 0) 0)) (.cse44 (= (select |#valid| 0) 0)) (.cse8 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse45 (= (select |#length| 1) 1)) (.cse46 (= (select |#valid| 2) 1)) (.cse47 (= 48 (select |#length| 5))) (.cse9 (= |#NULL.offset| 0)) (.cse10 (= ~globalFalse~0 0)) (.cse48 (<= 0 .cse56)) (.cse11 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse12 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse13 (= ~globalArgc~0 0)) (.cse14 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse51 (<= .cse56 0)) (.cse52 (= (select |#valid| 6) 1)) (.cse15 (= 5 ~globalFive~0)) (.cse53 (= (select |#valid| 10) 1)) (.cse54 (= (select |#valid| 8) 1)) (.cse55 (< 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0)) (.cse17 (= ~globalTrue~0 1))) (or (and .cse0 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 |#StackHeapBarrier|) .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse2 .cse3 .cse27 .cse28 .cse29 .cse30 .cse4 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse7 .cse41 .cse42 .cse43 .cse44 .cse8 .cse45 .cse46 .cse47 .cse9 .cse10 .cse48 .cse11 .cse13 .cse49 (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|) .cse50) (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)))) .cse51 .cse52 .cse15 .cse53 .cse54 .cse55 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse1 .cse25 .cse26 .cse2 (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|) .cse50) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse3 .cse27 .cse28 .cse29 .cse30 .cse4 .cse31 .cse32 .cse33 .cse5 .cse34 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse7 .cse41 .cse42 .cse43 .cse44 .cse8 .cse45 .cse46 .cse47 .cse9 .cse10 .cse11 .cse13 .cse49 .cse52 .cse15 .cse53 .cse54 .cse55 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse50 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse27 .cse28 .cse29 .cse4 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse6 .cse7 .cse41 .cse42 .cse43 .cse44 .cse8 .cse45 .cse46 .cse47 .cse9 .cse10 .cse48 .cse11 .cse12 .cse13 .cse14 .cse51 .cse52 .cse15 .cse53 .cse54 .cse55 .cse16 .cse17)))) [2022-11-19 08:20:11,872 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 08:20:11,873 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) 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 |#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 (= (select |#length| 8) 48)) (.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 (= 48 (select |#length| 5))) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (let ((.cse42 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 0 .cse42) .cse43 (<= .cse42 0) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 08:20:11,873 INFO L899 garLoopResultBuilder]: For program point L1597-1(lines 1591 1598) no Hoare annotation was computed. [2022-11-19 08:20:11,873 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 08:20:11,873 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1633) no Hoare annotation was computed. [2022-11-19 08:20:11,874 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= ~globalArgv~0.offset 0)) (.cse2 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse3 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse4 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse5 (= ~globalArgv~0.base 0)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (= ~globalFalse~0 0)) (.cse8 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse9 (= ~globalArgc~0 0)) (.cse10 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse11 (= 5 ~globalFive~0)) (.cse12 (= |#NULL.base| 0)) (.cse13 (= ~globalTrue~0 1))) (or (and .cse0 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |#StackHeapBarrier|) .cse12 .cse13) (let ((.cse14 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (and (= (select |#length| 9) 21) .cse0 (= (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) .cse1 .cse2 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= (store ((as const (Array Int Int)) 0) 0 0) (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)))) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) .cse3 (= |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|) .cse4 (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) .cse5 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) .cse6 .cse7 (<= 0 .cse14) .cse8 .cse9 .cse10 (<= .cse14 0) (= (select |#valid| 6) 1) .cse11 (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) .cse12 .cse13)))) [2022-11-19 08:20:11,874 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 08:20:11,875 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-19 08:20:11,875 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-19 08:20:11,875 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-19 08:20:11,875 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-19 08:20:11,875 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1598) no Hoare annotation was computed. [2022-11-19 08:20:11,876 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1613) no Hoare annotation was computed. [2022-11-19 08:20:11,876 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 08:20:11,876 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-11-19 08:20:11,877 INFO L899 garLoopResultBuilder]: For program point L1642-1(lines 1642 1648) no Hoare annotation was computed. [2022-11-19 08:20:11,877 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1649) no Hoare annotation was computed. [2022-11-19 08:20:11,877 INFO L899 garLoopResultBuilder]: For program point L1601(line 1601) no Hoare annotation was computed. [2022-11-19 08:20:11,877 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-19 08:20:11,877 INFO L899 garLoopResultBuilder]: For program point L1601-1(lines 1601 1612) no Hoare annotation was computed. [2022-11-19 08:20:11,878 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-19 08:20:11,878 INFO L899 garLoopResultBuilder]: For program point L1626(line 1626) no Hoare annotation was computed. [2022-11-19 08:20:11,878 INFO L899 garLoopResultBuilder]: For program point L1626-1(lines 1626 1632) no Hoare annotation was computed. [2022-11-19 08:20:11,879 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse55 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse56 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse7 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648))) (.cse13 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse2 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse6 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse11 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse17 (= (select |#length| 9) 21)) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse18 (= (select |#length| 6) 1)) (.cse19 (= 1 (select |#valid| 5))) (.cse1 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse20 (= (select (select |#memory_int| 2) 0) 0)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse22 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse23 (= (select |#valid| 9) 1)) (.cse24 (= (select |#valid| 11) 1)) (.cse25 (= (select (select |#memory_int| 1) 0) 0)) (.cse3 (= ~globalArgv~0.offset 0)) (.cse4 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse27 (= (select |#valid| 3) 1)) (.cse28 (= 21 (select |#length| 4))) (.cse29 (= (select |#valid| 7) 1)) (.cse53 (<= .cse56 0)) (.cse5 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= (select |#length| 10) 18)) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse33 (= 16 (select |#length| 7))) (.cse34 (= (select |#valid| 4) 1)) (.cse35 (= 16 (select |#length| 3))) (.cse36 (= (select |#length| 2) 1)) (.cse37 (= (select |#valid| 1) 1)) (.cse38 (= 16 (select |#length| 11))) (.cse39 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse8 (= ~globalArgv~0.base 0)) (.cse40 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse41 (= (select |#length| 8) 48)) (.cse42 (= (select (select |#memory_int| 6) 0) 0)) (.cse43 (= (select |#valid| 0) 0)) (.cse44 (= (select |#length| 1) 1)) (.cse45 (= (select |#valid| 2) 1)) (.cse46 (= 48 (select |#length| 5))) (.cse9 (= |#NULL.offset| 0)) (.cse10 (= ~globalFalse~0 0)) (.cse47 (<= 0 .cse55)) (.cse12 (= ~globalArgc~0 0)) (.cse54 (<= 0 .cse56)) (.cse26 (store ((as const (Array Int Int)) 0) 0 0)) (.cse48 (<= .cse55 0)) (.cse49 (= (select |#valid| 6) 1)) (.cse14 (= 5 ~globalFive~0)) (.cse50 (= (select |#valid| 10) 1)) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0)) (.cse16 (= ~globalTrue~0 1))) (or (and .cse0 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |#StackHeapBarrier|) .cse15 .cse16) (and .cse17 .cse0 .cse18 .cse19 .cse1 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse26 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse27 .cse28 .cse29 .cse5 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse7 .cse8 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse9 .cse10 .cse47 .cse11 .cse12 .cse13 .cse48 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16) (and .cse17 .cse0 .cse18 .cse19 .cse1 .cse20 .cse21 .cse22 .cse23 .cse2 .cse24 .cse25 .cse3 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse26) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse4 .cse27 .cse28 .cse29 .cse53 .cse5 .cse30 .cse31 .cse32 .cse6 .cse33 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse8 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse9 .cse10 .cse11 .cse12 .cse54 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16) (and .cse17 .cse0 .cse18 .cse19 .cse1 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 .cse27 .cse28 .cse29 .cse53 .cse5 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse8 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse9 .cse10 .cse47 .cse12 .cse54 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse26) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse48 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16)))) [2022-11-19 08:20:11,879 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-19 08:20:11,880 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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 08:20:11,880 INFO L899 garLoopResultBuilder]: For program point L1618-2(lines 1618 1625) no Hoare annotation was computed. [2022-11-19 08:20:11,880 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-19 08:20:11,881 INFO L895 garLoopResultBuilder]: At program point L1618-3(lines 1618 1625) the Hoare annotation is: (let ((.cse55 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse56 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse0 (= (select |#length| 9) 21)) (.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)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (<= .cse56 0)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 16 (select |#length| 7))) (.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|)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select |#length| 8) 48)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= 48 (select |#length| 5))) (.cse51 (<= 0 .cse55)) (.cse42 (<= 0 .cse56)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse54 (<= .cse55 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse50 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648))) (.cse30 (= ~globalArgv~0.base 0)) (.cse35 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse52 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse53 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse44 (= 5 ~globalFive~0)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_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|) .cse12) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse50 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse51 .cse52 .cse41 .cse53 .cse54 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse51 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse12) (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 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse1 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483648)) (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483646) .cse8 .cse11 .cse13 .cse18 .cse22 .cse50 .cse30 .cse35 .cse39 .cse40 .cse52 .cse41 .cse53 .cse44 (<= 0 |#StackHeapBarrier|) .cse48 .cse49)))) [2022-11-19 08:20:11,882 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-19 08:20:11,882 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 |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 08:20:11,883 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse48 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (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)) (.cse40 (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 (<= .cse48 0)) (.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 (= 16 (select |#length| 7))) (.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 |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= 48 (select |#length| 5))) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 .cse48)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (let ((.cse37 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 (<= 0 .cse37) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse40) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) (<= .cse37 0) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .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|) .cse40) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)))) [2022-11-19 08:20:11,884 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 08:20:11,884 INFO L895 garLoopResultBuilder]: At program point L1660(line 1660) 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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 08:20:11,884 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-19 08:20:11,885 INFO L899 garLoopResultBuilder]: For program point L1660-1(line 1660) no Hoare annotation was computed. [2022-11-19 08:20:11,885 INFO L899 garLoopResultBuilder]: For program point L1603(lines 1603 1611) no Hoare annotation was computed. [2022-11-19 08:20:11,885 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-19 08:20:11,886 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 |#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 |#length| 8) 48) (= (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) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 08:20:11,886 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 08:20:11,886 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: false [2022-11-19 08:20:11,887 INFO L895 garLoopResultBuilder]: At program point L1587(line 1587) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |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 |#length| 8) 48)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= 48 (select |#length| 5))) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (let ((.cse38 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 .cse38) .cse39 (<= .cse38 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse21 .cse22 .cse23 .cse24 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 08:20:11,887 INFO L899 garLoopResultBuilder]: For program point L1587-1(line 1587) no Hoare annotation was computed. [2022-11-19 08:20:11,887 INFO L899 garLoopResultBuilder]: For program point L1587-2(lines 1587 1600) no Hoare annotation was computed. [2022-11-19 08:20:11,888 INFO L895 garLoopResultBuilder]: At program point L1587-4(lines 1587 1600) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#valid| 4) 1)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.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 |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= 48 (select |#length| 5))) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .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) (let ((.cse47 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 .cse47) .cse37 .cse38 .cse39 (<= .cse47 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) [2022-11-19 08:20:11,888 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-19 08:20:11,889 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-11-19 08:20:11,889 INFO L895 garLoopResultBuilder]: At program point L1579(line 1579) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 .cse0) (= ~globalArgc~0 0) (<= .cse0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-19 08:20:11,890 INFO L899 garLoopResultBuilder]: For program point L1579-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-19 08:20:11,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-19 08:20:11,890 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-19 08:20:11,890 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-19 08:20:11,894 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] [2022-11-19 08:20:11,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:20:11,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:20:11 BoogieIcfgContainer [2022-11-19 08:20:11,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:20:11,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:20:11,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:20:11,910 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:20:11,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:16:59" (3/4) ... [2022-11-19 08:20:11,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 08:20:11,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 08:20:11,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-19 08:20:11,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 08:20:11,921 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-19 08:20:11,929 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 08:20:11,930 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-19 08:20:11,930 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 08:20:11,931 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 08:20:11,931 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 08:20:11,997 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:20:11,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:20:11,997 INFO L158 Benchmark]: Toolchain (without parser) took 194552.77ms. Allocated memory was 132.1MB in the beginning and 583.0MB in the end (delta: 450.9MB). Free memory was 96.5MB in the beginning and 381.7MB in the end (delta: -285.2MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. [2022-11-19 08:20:11,998 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:20:11,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1523.41ms. Allocated memory is still 132.1MB. Free memory was 96.1MB in the beginning and 55.1MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-19 08:20:11,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.82ms. Allocated memory is still 132.1MB. Free memory was 55.1MB in the beginning and 51.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:20:12,001 INFO L158 Benchmark]: Boogie Preprocessor took 71.11ms. Allocated memory is still 132.1MB. Free memory was 51.6MB in the beginning and 50.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:20:12,006 INFO L158 Benchmark]: RCFGBuilder took 636.42ms. Allocated memory is still 132.1MB. Free memory was 50.0MB in the beginning and 96.4MB in the end (delta: -46.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-11-19 08:20:12,007 INFO L158 Benchmark]: TraceAbstraction took 192124.59ms. Allocated memory was 132.1MB in the beginning and 583.0MB in the end (delta: 450.9MB). Free memory was 95.6MB in the beginning and 385.9MB in the end (delta: -290.2MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. [2022-11-19 08:20:12,008 INFO L158 Benchmark]: Witness Printer took 87.89ms. Allocated memory is still 583.0MB. Free memory was 385.9MB in the beginning and 381.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 08:20:12,010 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.25ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1523.41ms. Allocated memory is still 132.1MB. Free memory was 96.1MB in the beginning and 55.1MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.82ms. Allocated memory is still 132.1MB. Free memory was 55.1MB in the beginning and 51.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.11ms. Allocated memory is still 132.1MB. Free memory was 51.6MB in the beginning and 50.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.42ms. Allocated memory is still 132.1MB. Free memory was 50.0MB in the beginning and 96.4MB in the end (delta: -46.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 192124.59ms. Allocated memory was 132.1MB in the beginning and 583.0MB in the end (delta: 450.9MB). Free memory was 95.6MB in the beginning and 385.9MB in the end (delta: -290.2MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. * Witness Printer took 87.89ms. Allocated memory is still 583.0MB. Free memory was 385.9MB in the beginning and 381.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 192.0s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 619 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 4981 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2551 IncrementalHoareTripleChecker+Unchecked, 3367 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2042 IncrementalHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 1614 mSDtfsCounter, 2042 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 1487 SyntacticMatches, 34 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4343 ImplicationChecksByTransitivity, 111.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=19, InterpolantAutomatonStates: 301, 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, 22 MinimizatonAttempts, 161 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 131 PreInvPairs, 170 NumberOfFragments, 8637 HoareAnnotationTreeSize, 131 FomulaSimplifications, 5869 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 25 FomulaSimplificationsInter, 25256 FormulaSimplificationTreeSizeReductionInter, 23.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2346 ConstructedInterpolants, 0 QuantifiedInterpolants, 2991 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3948 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 44 InterpolantComputations, 15 PerfectInterpolantSequences, 1152/1190 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: 41.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 35, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 414, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 274, TOOLS_POST_TIME: 17.6s, TOOLS_POST_CALL_APPLICATIONS: 252, TOOLS_POST_CALL_TIME: 10.3s, TOOLS_POST_RETURN_APPLICATIONS: 168, TOOLS_POST_RETURN_TIME: 7.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 694, TOOLS_QUANTIFIERELIM_TIME: 35.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 982, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 224, DOMAIN_JOIN_TIME: 4.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 414, DOMAIN_ISBOTTOM_TIME: 1.2s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 168, CALL_SUMMARIZER_CACHE_MISSES: 28, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 13489, DAG_COMPRESSION_RETAINED_NODES: 1003, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1662]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-19 08:20:12,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6034a7c-3d80-448e-bf9c-d504cc88faed/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