./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-examples/standard_init7_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-examples/standard_init7_ground-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur --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 32bit --witnessprinter.graph.data.programhash b5676c3d6dc03d9d7c01548ab66d69c2eb88a4e88b4b03557196f7f055f86c4c --- 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-38b53e6 [2022-11-26 00:56:35,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:56:35,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:56:35,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:56:35,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:56:35,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:56:35,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:56:35,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:56:35,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:56:35,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:56:35,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:56:35,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:56:35,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:56:35,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:56:35,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:56:35,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:56:35,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:56:35,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:56:35,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:56:35,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:56:35,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:56:35,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:56:35,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:56:35,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:56:35,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:56:35,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:56:35,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:56:35,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:56:35,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:56:35,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:56:35,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:56:35,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:56:35,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:56:35,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:56:35,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:56:35,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:56:35,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:56:35,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:56:35,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:56:35,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:56:35,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:56:35,355 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:56:35,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:56:35,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:56:35,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:56:35,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:56:35,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:56:35,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:56:35,384 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:56:35,384 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:56:35,384 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:56:35,385 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:56:35,385 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:56:35,385 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:56:35,386 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:56:35,386 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:56:35,386 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:56:35,387 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:56:35,387 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:56:35,387 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:56:35,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:56:35,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:56:35,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:56:35,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:56:35,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:56:35,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:56:35,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:56:35,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:56:35,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:56:35,391 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:56:35,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:56:35,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:56:35,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:56:35,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:56:35,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:56:35,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:56:35,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:56:35,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:56:35,394 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:56:35,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:56:35,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:56:35,395 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:56:35,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:56:35,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:56:35,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:56:35,396 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_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/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_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5676c3d6dc03d9d7c01548ab66d69c2eb88a4e88b4b03557196f7f055f86c4c [2022-11-26 00:56:35,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:56:35,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:56:35,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:56:35,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:56:35,789 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:56:35,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-examples/standard_init7_ground-1.i [2022-11-26 00:56:38,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:56:39,238 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:56:39,239 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/sv-benchmarks/c/array-examples/standard_init7_ground-1.i [2022-11-26 00:56:39,247 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/data/1e18d9854/2bb6ad76a90b421ba2fe8810ea5cb6de/FLAG8abddd906 [2022-11-26 00:56:39,263 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/data/1e18d9854/2bb6ad76a90b421ba2fe8810ea5cb6de [2022-11-26 00:56:39,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:56:39,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:56:39,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:56:39,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:56:39,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:56:39,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2a808e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39, skipping insertion in model container [2022-11-26 00:56:39,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:56:39,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:56:39,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/sv-benchmarks/c/array-examples/standard_init7_ground-1.i[816,829] [2022-11-26 00:56:39,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:56:39,490 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:56:39,506 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/sv-benchmarks/c/array-examples/standard_init7_ground-1.i[816,829] [2022-11-26 00:56:39,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:56:39,535 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:56:39,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39 WrapperNode [2022-11-26 00:56:39,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:56:39,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:56:39,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:56:39,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:56:39,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,585 INFO L138 Inliner]: procedures = 15, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-11-26 00:56:39,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:56:39,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:56:39,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:56:39,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:56:39,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,631 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:56:39,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:56:39,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:56:39,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:56:39,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (1/1) ... [2022-11-26 00:56:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:56:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:39,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:56:39,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:56:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:56:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:56:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:56:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:56:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:56:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:56:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:56:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:56:39,814 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:56:39,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:56:40,091 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:56:40,248 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:56:40,248 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-26 00:56:40,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:40 BoogieIcfgContainer [2022-11-26 00:56:40,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:56:40,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:56:40,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:56:40,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:56:40,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:56:39" (1/3) ... [2022-11-26 00:56:40,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb0c16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:56:40, skipping insertion in model container [2022-11-26 00:56:40,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:56:39" (2/3) ... [2022-11-26 00:56:40,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb0c16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:56:40, skipping insertion in model container [2022-11-26 00:56:40,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:40" (3/3) ... [2022-11-26 00:56:40,273 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init7_ground-1.i [2022-11-26 00:56:40,308 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:56:40,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-26 00:56:40,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:56:40,393 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;@3c1f04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:56:40,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-26 00:56:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.96) internal successors, (49), 41 states have internal predecessors, (49), 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-26 00:56:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:56:40,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:40,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:56:40,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:56:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 178138, now seen corresponding path program 1 times [2022-11-26 00:56:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:40,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591735842] [2022-11-26 00:56:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:40,684 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-26 00:56:40,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:40,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591735842] [2022-11-26 00:56:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591735842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:40,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:56:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187491895] [2022-11-26 00:56:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:40,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:40,755 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.96) internal successors, (49), 41 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:56:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:40,946 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-11-26 00:56:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-11-26 00:56:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:40,957 INFO L225 Difference]: With dead ends: 101 [2022-11-26 00:56:40,957 INFO L226 Difference]: Without dead ends: 62 [2022-11-26 00:56:40,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 00:56:40,963 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:40,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-26 00:56:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-26 00:56:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.5) internal successors, (69), 61 states have internal predecessors, (69), 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-26 00:56:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-11-26 00:56:41,003 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 3 [2022-11-26 00:56:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:41,004 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-11-26 00:56:41,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-26 00:56:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-11-26 00:56:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:56:41,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:41,005 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-26 00:56:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:56:41,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:56:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1011986421, now seen corresponding path program 1 times [2022-11-26 00:56:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:41,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324076528] [2022-11-26 00:56:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:41,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324076528] [2022-11-26 00:56:41,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324076528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241733512] [2022-11-26 00:56:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:41,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:41,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:56:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:41,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:41,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:41,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:56:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241733512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:41,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:56:41,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-26 00:56:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34284685] [2022-11-26 00:56:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:41,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:56:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:56:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:41,311 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:56:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:41,511 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-11-26 00:56:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:56:41,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-11-26 00:56:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:41,516 INFO L225 Difference]: With dead ends: 62 [2022-11-26 00:56:41,517 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:56:41,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:56:41,519 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:41,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:56:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-26 00:56:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 54 states have internal predecessors, (62), 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-26 00:56:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-26 00:56:41,541 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 6 [2022-11-26 00:56:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:41,542 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-26 00:56:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:56:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-26 00:56:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:56:41,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:41,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2022-11-26 00:56:41,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:41,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-26 00:56:41,751 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:56:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1306808024, now seen corresponding path program 1 times [2022-11-26 00:56:41,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:41,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040443246] [2022-11-26 00:56:41,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:56:41,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040443246] [2022-11-26 00:56:41,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040443246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:41,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:56:41,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:56:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50192888] [2022-11-26 00:56:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:41,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:56:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:56:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:56:41,864 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-26 00:56:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:41,968 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-26 00:56:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:56:41,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2022-11-26 00:56:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:41,980 INFO L225 Difference]: With dead ends: 55 [2022-11-26 00:56:41,981 INFO L226 Difference]: Without dead ends: 48 [2022-11-26 00:56:41,981 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-26 00:56:41,985 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:41,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:56:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-26 00:56:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-11-26 00:56:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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-26 00:56:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-26 00:56:41,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 7 [2022-11-26 00:56:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:41,999 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-26 00:56:41,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-26 00:56:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-26 00:56:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:56:42,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:42,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:42,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:56:42,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:56:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 754035917, now seen corresponding path program 1 times [2022-11-26 00:56:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842623819] [2022-11-26 00:56:42,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:56:42,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842623819] [2022-11-26 00:56:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842623819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109107780] [2022-11-26 00:56:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:42,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:42,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:56:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:42,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:56:42,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:56:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109107780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1234997359] [2022-11-26 00:56:42,542 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 00:56:42,543 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:56:42,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:56:42,554 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:56:42,555 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:56:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:42,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:56:42,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-26 00:56:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:42,780 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:56:42,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-26 00:56:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:42,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-26 00:56:42,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:42,882 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 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-26 00:56:43,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:56:43,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,070 INFO L321 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-11-26 00:56:43,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 191 [2022-11-26 00:56:43,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:56:43,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,391 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:56:43,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 67 [2022-11-26 00:56:43,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:56:43,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:43,559 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:56:43,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 67 [2022-11-26 00:56:43,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:56:43,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2022-11-26 00:56:43,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:56:43,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2022-11-26 00:56:43,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:43,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,041 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:56:44,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 55 [2022-11-26 00:56:44,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2022-11-26 00:56:44,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:44,307 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:56:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1234997359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:44,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:56:44,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 14 [2022-11-26 00:56:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607288652] [2022-11-26 00:56:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:56:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:56:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:56:44,954 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-26 00:56:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:45,328 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-26 00:56:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:56:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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) Word has length 31 [2022-11-26 00:56:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:45,331 INFO L225 Difference]: With dead ends: 39 [2022-11-26 00:56:45,331 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:56:45,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:56:45,332 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:45,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:56:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:56:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:56:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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-26 00:56:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-26 00:56:45,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 31 [2022-11-26 00:56:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:45,349 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-26 00:56:45,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-26 00:56:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-26 00:56:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:56:45,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:45,351 INFO L195 NwaCegarLoop]: trace histogram [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-26 00:56:45,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:45,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:45,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-11-26 00:56:45,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 805218698, now seen corresponding path program 1 times [2022-11-26 00:56:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:45,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634881626] [2022-11-26 00:56:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:56:45,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:56:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634881626] [2022-11-26 00:56:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634881626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:56:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285418281] [2022-11-26 00:56:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:56:45,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:56:45,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:56:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:56:45,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:56:45,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:56:45,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:56:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285418281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919942787] [2022-11-26 00:56:45,906 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:56:45,906 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:56:45,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:56:45,907 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:56:45,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:56:45,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,002 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 00:56:46,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-26 00:56:46,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,034 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:56:46,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-26 00:56:46,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-26 00:56:46,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,087 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 0 case distinctions, treesize of input 42 treesize of output 47 [2022-11-26 00:56:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,189 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-26 00:56:46,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 196 [2022-11-26 00:56:46,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:56:46,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:56:46,355 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:56:46,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 67 [2022-11-26 00:56:46,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:56:46,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2022-11-26 00:56:46,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:56:46,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2022-11-26 00:56:46,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:56:46,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2022-11-26 00:56:46,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,793 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:56:46,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 55 [2022-11-26 00:56:46,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2022-11-26 00:56:46,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:46,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:47,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:47,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:56:47,227 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:56:48,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [919942787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:56:48,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:56:48,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [3, 3, 3] total 16 [2022-11-26 00:56:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129440722] [2022-11-26 00:56:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:56:48,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:56:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:56:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:56:48,142 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-26 00:56:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:49,337 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-11-26 00:56:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:56:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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) Word has length 34 [2022-11-26 00:56:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:49,338 INFO L225 Difference]: With dead ends: 49 [2022-11-26 00:56:49,338 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:56:49,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-11-26 00:56:49,339 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:56:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:56:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:56:49,340 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-26 00:56:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:56:49,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-11-26 00:56:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:56:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-26 00:56:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:56:49,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:56:49,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-11-26 00:56:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-11-26 00:56:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-11-26 00:56:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-11-26 00:56:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-11-26 00:56:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-11-26 00:56:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-11-26 00:56:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-11-26 00:56:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-11-26 00:56:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-11-26 00:56:49,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:49,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:56:49,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:56:50,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-11-26 00:56:50,630 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 30) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,630 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-26 00:56:50,630 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-11-26 00:56:50,631 INFO L899 garLoopResultBuilder]: For program point L52-3(line 52) no Hoare annotation was computed. [2022-11-26 00:56:50,631 INFO L899 garLoopResultBuilder]: For program point L52-4(line 52) no Hoare annotation was computed. [2022-11-26 00:56:50,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-26 00:56:50,631 INFO L895 garLoopResultBuilder]: At program point L52-5(lines 52 54) the Hoare annotation is: (and (let ((.cse0 (<= 100000 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse2 (<= 0 |ULTIMATE.start_main_~#a~0#1.offset|)) (.cse3 (<= |#NULL.offset| 0)) (.cse4 (<= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse5 (<= 0 |#NULL.offset|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~x~0#1| 2147483647) .cse2 .cse3 (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) .cse4 (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (<= 0 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) .cse5) (and .cse0 (<= 0 |ULTIMATE.start_main_~x~0#1|) .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~x~0#1| 0) .cse5))) (<= |ULTIMATE.start_main_~i~0#1| 100000) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-26 00:56:50,631 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-11-26 00:56:50,632 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-11-26 00:56:50,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-26 00:56:50,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-11-26 00:56:50,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:56:50,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-26 00:56:50,633 INFO L895 garLoopResultBuilder]: At program point L37-2(lines 37 40) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_main_~i~0#1| 100000) .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-11-26 00:56:50,633 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-11-26 00:56:50,633 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-11-26 00:56:50,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-26 00:56:50,634 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,634 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 50) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_main_~i~0#1| 100000) .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-26 00:56:50,634 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-26 00:56:50,634 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-26 00:56:50,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 44) no Hoare annotation was computed. [2022-11-26 00:56:50,635 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-26 00:56:50,635 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-11-26 00:56:50,636 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-11-26 00:56:50,636 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-11-26 00:56:50,636 INFO L899 garLoopResultBuilder]: For program point L49-1(line 49) no Hoare annotation was computed. [2022-11-26 00:56:50,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2022-11-26 00:56:50,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:56:50,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2022-11-26 00:56:50,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 49) no Hoare annotation was computed. [2022-11-26 00:56:50,637 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 20) the Hoare annotation is: (and (let ((.cse0 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse1 (= |#NULL.offset| 0)) (.cse2 (= |#NULL.base| 0))) (or (and (<= 0 |ULTIMATE.start_main_~#a~0#1.base|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse0 .cse1 .cse2) (let ((.cse3 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~i~0#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#a~0#1.base|) (= 26 (select |#length| 2)) (= 2 (select |#length| 1)) (= 400000 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (= (select |#valid| 1) 1) .cse0 (= (select |#valid| |ULTIMATE.start_main_~#a~0#1.base|) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse1 (= (select .cse3 0) 48) (= (select .cse3 1) 0) (< 0 |#StackHeapBarrier|) .cse2)))) (<= 0 |#StackHeapBarrier|)) [2022-11-26 00:56:50,638 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 45) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~#a~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |#NULL.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|)) (.cse4 (= |#NULL.base| 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_main_~i~0#1| 100000) .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2022-11-26 00:56:50,638 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-26 00:56:50,638 INFO L899 garLoopResultBuilder]: For program point L34-1(line 34) no Hoare annotation was computed. [2022-11-26 00:56:50,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-11-26 00:56:50,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 52) no Hoare annotation was computed. [2022-11-26 00:56:50,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2022-11-26 00:56:50,643 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-26 00:56:50,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:56:50,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:56:50 BoogieIcfgContainer [2022-11-26 00:56:50,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:56:50,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:56:50,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:56:50,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:56:50,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:56:40" (3/4) ... [2022-11-26 00:56:50,694 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:56:50,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-26 00:56:50,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-26 00:56:50,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:56:50,707 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:56:50,738 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((100000 <= i && 0 <= a) && x <= 2147483647) && 0 <= a) && #NULL <= 0) && cond <= 1) && 1 <= x) && a <= 0) && \old(cond) <= 1) && 0 <= cond) && 0 <= \old(cond)) && 0 <= #NULL) || (((((((100000 <= i && 0 <= x) && 0 <= a) && 0 <= a) && #NULL <= 0) && a <= 0) && x <= 0) && 0 <= #NULL)) && i <= 100000) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 [2022-11-26 00:56:50,753 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:56:50,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:56:50,754 INFO L158 Benchmark]: Toolchain (without parser) took 11486.39ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 149.1MB in the beginning and 143.3MB in the end (delta: 5.8MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,755 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 140.5MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:56:50,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.71ms. Allocated memory is still 182.5MB. Free memory was 149.1MB in the beginning and 138.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.49ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 136.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,756 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 182.5MB. Free memory was 136.6MB in the beginning and 135.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,756 INFO L158 Benchmark]: RCFGBuilder took 625.33ms. Allocated memory is still 182.5MB. Free memory was 135.5MB in the beginning and 118.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,757 INFO L158 Benchmark]: TraceAbstraction took 10424.05ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 118.7MB in the beginning and 146.5MB in the end (delta: -27.8MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,757 INFO L158 Benchmark]: Witness Printer took 64.51ms. Allocated memory is still 220.2MB. Free memory was 146.5MB in the beginning and 143.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:56:50,759 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.83ms. Allocated memory is still 140.5MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.71ms. Allocated memory is still 182.5MB. Free memory was 149.1MB in the beginning and 138.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.49ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 136.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 182.5MB. Free memory was 136.6MB in the beginning and 135.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.33ms. Allocated memory is still 182.5MB. Free memory was 135.5MB in the beginning and 118.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10424.05ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 118.7MB in the beginning and 146.5MB in the end (delta: -27.8MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 64.51ms. Allocated memory is still 220.2MB. Free memory was 146.5MB in the beginning and 143.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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 1 procedures, 42 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 28 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 157 SyntacticMatches, 17 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=1, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 23 NumberOfFragments, 417 HoareAnnotationTreeSize, 8 FomulaSimplifications, 96 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1103 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 47/55 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: 3.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 200, TOOLS_POST_TIME: 2.3s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 200, TOOLS_QUANTIFIERELIM_TIME: 2.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 358, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 30, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 45, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 15, LOOP_SUMMARIZER_CACHE_MISSES: 15, LOOP_SUMMARIZER_OVERALL_TIME: 1.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 45, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 8767, DAG_COMPRESSION_RETAINED_NODES: 199, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((0 <= a && 1 <= i) && i <= 2147483647) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((0 <= a && 1 <= i) && i <= 2147483647) && a == 0) && #NULL == 0) && #NULL == 0) || ((((((((((((((i == 0 && unknown-#StackHeapBarrier-unknown < a) && 26 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && 400000 == unknown-#length-unknown[a]) && \valid[1] == 1) && a == 0) && \valid[a] == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) && 0 <= unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((0 <= a && 1 <= i) && a == 0) && #NULL == 0) && i <= 100000) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((0 <= a && 1 <= i) && a == 0) && #NULL == 0) && i <= 100000) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((0 <= a && 1 <= i) && a == 0) && #NULL == 0) && i <= 100000) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((((100000 <= i && 0 <= a) && x <= 2147483647) && 0 <= a) && #NULL <= 0) && cond <= 1) && 1 <= x) && a <= 0) && \old(cond) <= 1) && 0 <= cond) && 0 <= \old(cond)) && 0 <= #NULL) || (((((((100000 <= i && 0 <= x) && 0 <= a) && 0 <= a) && #NULL <= 0) && a <= 0) && x <= 0) && 0 <= #NULL)) && i <= 100000) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((0 <= a && 1 <= i) && i <= 2147483647) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((i == 0 && 0 <= a) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((0 <= a && 1 <= i) && i <= 2147483647) && a == 0) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:56:50,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5f63004-3ebb-4b8c-9f60-53670a89d37a/bin/utaipan-ByfvJB40ur/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