./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d04e0a263780757f9d0a81eb77d81932d95f9f5fc37920c99d442b84c4e5091a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:49:40,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:49:40,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:49:40,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:49:40,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:49:40,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:49:40,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:49:40,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:49:40,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:49:40,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:49:40,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:49:40,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:49:40,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:49:40,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:49:40,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:49:40,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:49:40,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:49:40,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:49:40,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:49:40,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:49:40,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:49:40,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:49:40,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:49:40,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:49:40,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:49:40,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:49:40,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:49:40,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:49:40,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:49:40,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:49:40,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:49:40,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:49:40,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:49:40,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:49:40,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:49:40,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:49:40,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:49:40,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:49:40,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:49:40,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:49:40,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:49:40,670 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:49:40,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:49:40,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:49:40,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:49:40,698 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:49:40,698 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:49:40,699 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:49:40,699 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:49:40,700 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:49:40,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:49:40,700 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:49:40,701 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:49:40,701 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:49:40,702 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:49:40,702 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:49:40,702 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:49:40,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:49:40,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:49:40,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:49:40,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:49:40,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:49:40,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:49:40,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:49:40,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:49:40,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:49:40,707 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:49:40,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:49:40,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:49:40,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:49:40,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:49:40,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:49:40,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:40,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:49:40,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:49:40,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:49:40,710 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:49:40,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:49:40,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:49:40,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:49:40,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:49:40,712 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8 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 ! call(reach_error())) ) 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 -> d04e0a263780757f9d0a81eb77d81932d95f9f5fc37920c99d442b84c4e5091a [2021-11-07 01:49:41,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:49:41,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:49:41,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:49:41,044 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:49:41,045 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:49:41,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-07 01:49:41,121 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/data/c096b475f/fe4990174d0249e1a29fa8e8e710ea2c/FLAG822f98277 [2021-11-07 01:49:41,736 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:49:41,737 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-07 01:49:41,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/data/c096b475f/fe4990174d0249e1a29fa8e8e710ea2c/FLAG822f98277 [2021-11-07 01:49:42,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/data/c096b475f/fe4990174d0249e1a29fa8e8e710ea2c [2021-11-07 01:49:42,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:49:42,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:49:42,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:42,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:49:42,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:49:42,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c488346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42, skipping insertion in model container [2021-11-07 01:49:42,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:49:42,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:49:42,343 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-11-07 01:49:42,362 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-11-07 01:49:42,374 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-11-07 01:49:42,378 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-11-07 01:49:42,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:42,388 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:49:42,405 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-11-07 01:49:42,410 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-11-07 01:49:42,413 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-11-07 01:49:42,417 WARN L228 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_3f9f7ff0-4445-48f9-8206-60d27cf13a88/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-11-07 01:49:42,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:49:42,433 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:49:42,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42 WrapperNode [2021-11-07 01:49:42,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:49:42,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:42,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:49:42,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:49:42,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:49:42,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:49:42,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:49:42,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:49:42,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:49:42,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:49:42,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:49:42,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:49:42,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (1/1) ... [2021-11-07 01:49:42,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:49:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:49:42,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:49:42,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:49:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:49:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:49:42,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:49:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 01:49:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:49:42,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:49:42,932 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:49:42,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:42 BoogieIcfgContainer [2021-11-07 01:49:42,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:49:42,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:49:42,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:49:42,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:49:42,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:49:42" (1/3) ... [2021-11-07 01:49:42,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df26649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:42, skipping insertion in model container [2021-11-07 01:49:42,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:42" (2/3) ... [2021-11-07 01:49:42,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df26649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:42, skipping insertion in model container [2021-11-07 01:49:42,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:42" (3/3) ... [2021-11-07 01:49:42,945 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-07 01:49:42,950 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:49:42,950 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-07 01:49:43,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:49:43,040 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:49:43,041 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-07 01:49:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 34 states have internal predecessors, (51), 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) [2021-11-07 01:49:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:49:43,078 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:43,079 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:43,079 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash -238958999, now seen corresponding path program 1 times [2021-11-07 01:49:43,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:43,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079693836] [2021-11-07 01:49:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:43,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:43,412 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:43,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079693836] [2021-11-07 01:49:43,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079693836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:43,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:43,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:49:43,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131129603] [2021-11-07 01:49:43,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:49:43,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:49:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:43,461 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 34 states have internal predecessors, (51), 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, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-11-07 01:49:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:43,504 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-11-07 01:49:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:49:43,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2021-11-07 01:49:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:43,515 INFO L225 Difference]: With dead ends: 47 [2021-11-07 01:49:43,516 INFO L226 Difference]: Without dead ends: 29 [2021-11-07 01:49:43,518 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:49:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-07 01:49:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-07 01:49:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 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) [2021-11-07 01:49:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-11-07 01:49:43,557 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2021-11-07 01:49:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:43,557 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-11-07 01:49:43,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-11-07 01:49:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2021-11-07 01:49:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:49:43,558 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:43,558 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:43,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:49:43,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1055861953, now seen corresponding path program 1 times [2021-11-07 01:49:43,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:43,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434279580] [2021-11-07 01:49:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:43,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:43,605 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:43,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434279580] [2021-11-07 01:49:43,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434279580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:43,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:43,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:49:43,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700965594] [2021-11-07 01:49:43,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:49:43,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:43,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:49:43,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:43,610 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-11-07 01:49:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:43,652 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-11-07 01:49:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:49:43,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2021-11-07 01:49:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:43,654 INFO L225 Difference]: With dead ends: 55 [2021-11-07 01:49:43,654 INFO L226 Difference]: Without dead ends: 34 [2021-11-07 01:49:43,655 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-07 01:49:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-11-07 01:49:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 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) [2021-11-07 01:49:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-07 01:49:43,661 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2021-11-07 01:49:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:43,661 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-07 01:49:43,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-11-07 01:49:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-07 01:49:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:49:43,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:43,662 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:43,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:49:43,663 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1125304774, now seen corresponding path program 1 times [2021-11-07 01:49:43,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:43,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137311280] [2021-11-07 01:49:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:43,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:43,764 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:43,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137311280] [2021-11-07 01:49:43,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137311280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:43,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:43,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:49:43,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106809667] [2021-11-07 01:49:43,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:49:43,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:49:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:49:43,768 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-07 01:49:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:43,800 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2021-11-07 01:49:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:49:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-11-07 01:49:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:43,803 INFO L225 Difference]: With dead ends: 48 [2021-11-07 01:49:43,803 INFO L226 Difference]: Without dead ends: 46 [2021-11-07 01:49:43,803 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:49:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-07 01:49:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2021-11-07 01:49:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 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) [2021-11-07 01:49:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-07 01:49:43,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 9 [2021-11-07 01:49:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:43,811 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-07 01:49:43,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-11-07 01:49:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-07 01:49:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:49:43,812 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:43,812 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:43,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:49:43,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -461793925, now seen corresponding path program 1 times [2021-11-07 01:49:43,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:43,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589975474] [2021-11-07 01:49:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:43,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:43,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:43,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589975474] [2021-11-07 01:49:43,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589975474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:43,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:43,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:49:43,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753737552] [2021-11-07 01:49:43,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:49:43,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:49:43,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:43,912 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-07 01:49:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:43,959 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2021-11-07 01:49:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:49:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2021-11-07 01:49:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:43,961 INFO L225 Difference]: With dead ends: 51 [2021-11-07 01:49:43,961 INFO L226 Difference]: Without dead ends: 30 [2021-11-07 01:49:43,962 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:49:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-07 01:49:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-07 01:49:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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) [2021-11-07 01:49:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-07 01:49:43,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2021-11-07 01:49:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:43,967 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-07 01:49:43,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-07 01:49:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-11-07 01:49:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:49:43,968 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:43,969 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:43,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:49:43,969 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash 67089498, now seen corresponding path program 1 times [2021-11-07 01:49:43,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:43,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069586076] [2021-11-07 01:49:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:43,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:45,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:45,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069586076] [2021-11-07 01:49:45,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069586076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:45,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:45,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:49:45,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931458213] [2021-11-07 01:49:45,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:49:45,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:49:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:49:45,585 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2021-11-07 01:49:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:46,004 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2021-11-07 01:49:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:49:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2021-11-07 01:49:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:46,006 INFO L225 Difference]: With dead ends: 42 [2021-11-07 01:49:46,006 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 01:49:46,007 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:49:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 01:49:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-11-07 01:49:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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) [2021-11-07 01:49:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-11-07 01:49:46,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2021-11-07 01:49:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:46,013 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-07 01:49:46,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2021-11-07 01:49:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-11-07 01:49:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:49:46,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:46,014 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:46,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:49:46,015 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1399323306, now seen corresponding path program 1 times [2021-11-07 01:49:46,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:46,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307908350] [2021-11-07 01:49:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:46,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:46,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:46,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307908350] [2021-11-07 01:49:46,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307908350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:46,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:49:46,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:49:46,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491108519] [2021-11-07 01:49:46,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:49:46,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:49:46,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:49:46,068 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-07 01:49:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:46,119 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-11-07 01:49:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:49:46,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2021-11-07 01:49:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:46,121 INFO L225 Difference]: With dead ends: 39 [2021-11-07 01:49:46,121 INFO L226 Difference]: Without dead ends: 37 [2021-11-07 01:49:46,121 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:49:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-07 01:49:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2021-11-07 01:49:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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) [2021-11-07 01:49:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-07 01:49:46,127 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2021-11-07 01:49:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:46,127 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-07 01:49:46,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2021-11-07 01:49:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-07 01:49:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:49:46,129 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:46,129 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:46,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:49:46,129 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1507348966, now seen corresponding path program 1 times [2021-11-07 01:49:46,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:46,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449680310] [2021-11-07 01:49:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:46,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:46,285 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:46,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449680310] [2021-11-07 01:49:46,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449680310] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:49:46,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064715378] [2021-11-07 01:49:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:46,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:49:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:49:46,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:49:46,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:49:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:46,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:49:46,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:49:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:46,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:49:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:46,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064715378] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:49:46,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1488833822] [2021-11-07 01:49:46,845 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-07 01:49:46,845 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:49:46,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:49:46,858 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:49:46,859 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:49:46,911 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:46,928 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:46,930 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:46,931 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-11-07 01:49:46,933 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:46,933 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:46,934 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:49:46,941 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 164 [2021-11-07 01:49:46,971 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_13|], 36=[|v_#valid_34|]} [2021-11-07 01:49:46,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:46,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:46,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:46,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2021-11-07 01:49:47,007 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,008 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:49:47,008 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,009 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:49:47,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:49:47,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:47,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2021-11-07 01:49:47,091 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,094 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:49:47,095 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,096 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:49:47,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:49:47,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,112 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,114 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:49:47,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:49:47,118 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:123 [2021-11-07 01:49:47,132 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,141 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-11-07 01:49:47,164 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,172 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 153 [2021-11-07 01:49:47,185 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,200 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 235 [2021-11-07 01:49:47,220 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,250 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:47,251 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-11-07 01:49:47,266 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 333 [2021-11-07 01:49:47,330 INFO L180 QuantifierPusher]: treesize reduction 8, result has 98.8 percent of original size [2021-11-07 01:49:47,342 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 717 [2021-11-07 01:49:47,361 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:47,399 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 858 [2021-11-07 01:49:47,466 INFO L180 QuantifierPusher]: treesize reduction 8, result has 99.1 percent of original size [2021-11-07 01:49:47,496 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 959 [2021-11-07 01:49:47,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:47,907 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:49:52,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1488833822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:49:52,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:49:52,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7, 4, 4] total 22 [2021-11-07 01:49:52,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683123764] [2021-11-07 01:49:52,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:49:52,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:49:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:49:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:49:52,344 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-11-07 01:49:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:49:52,665 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-11-07 01:49:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:49:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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 18 [2021-11-07 01:49:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:49:52,667 INFO L225 Difference]: With dead ends: 38 [2021-11-07 01:49:52,667 INFO L226 Difference]: Without dead ends: 30 [2021-11-07 01:49:52,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:49:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-07 01:49:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2021-11-07 01:49:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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) [2021-11-07 01:49:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-11-07 01:49:52,673 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2021-11-07 01:49:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:49:52,673 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-07 01:49:52,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 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) [2021-11-07 01:49:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-11-07 01:49:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:49:52,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:49:52,674 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:49:52,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 01:49:52,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-07 01:49:52,882 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-07 01:49:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:49:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1799200339, now seen corresponding path program 1 times [2021-11-07 01:49:52,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:49:52,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404441304] [2021-11-07 01:49:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:52,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:49:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:53,313 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:49:53,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404441304] [2021-11-07 01:49:53,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404441304] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:49:53,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711285534] [2021-11-07 01:49:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:49:53,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:49:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:49:53,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:49:53,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:49:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:49:53,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:49:53,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:49:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:53,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:49:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:49:53,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711285534] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:49:53,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [139029297] [2021-11-07 01:49:53,757 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-07 01:49:53,758 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:49:53,765 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:49:53,765 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:49:53,766 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:49:53,785 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,787 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:53,788 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,788 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-11-07 01:49:53,789 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:53,789 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,790 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-11-07 01:49:53,791 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 164 [2021-11-07 01:49:53,798 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_14|], 36=[|v_#valid_35|]} [2021-11-07 01:49:53,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2021-11-07 01:49:53,817 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,817 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:49:53,818 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,818 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:49:53,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:49:53,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:53,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:49:53,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2021-11-07 01:49:53,862 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,865 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:49:53,866 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,889 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-07 01:49:53,890 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:49:53,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:53,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,901 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,902 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 123 [2021-11-07 01:49:53,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:49:53,903 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:161, output treesize:123 [2021-11-07 01:49:53,907 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,911 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-11-07 01:49:53,927 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,931 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 153 [2021-11-07 01:49:53,938 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,942 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 235 [2021-11-07 01:49:53,953 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,962 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:53,963 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,965 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-11-07 01:49:53,977 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 333 [2021-11-07 01:49:53,987 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:53,992 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 363 [2021-11-07 01:49:54,000 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,006 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 445 [2021-11-07 01:49:54,015 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,032 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:49:54,033 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,035 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-11-07 01:49:54,044 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 569 [2021-11-07 01:49:54,090 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,099 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 363 [2021-11-07 01:49:54,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,179 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,191 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 445 [2021-11-07 01:49:54,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,329 INFO L180 QuantifierPusher]: treesize reduction 8, result has 99.4 percent of original size [2021-11-07 01:49:54,346 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1567 [2021-11-07 01:49:54,363 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:49:54,446 INFO L185 QuantifierPusher]: treesize reduction 202, result has 86.2 percent of original size 1264 [2021-11-07 01:49:54,527 INFO L180 QuantifierPusher]: treesize reduction 8, result has 99.4 percent of original size [2021-11-07 01:49:54,543 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1515 [2021-11-07 01:49:54,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:54,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:49:55,003 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:50:04,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [139029297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:50:04,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:50:04,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11, 4, 4] total 28 [2021-11-07 01:50:04,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933888869] [2021-11-07 01:50:04,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:50:04,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:50:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:50:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:50:04,645 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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) [2021-11-07 01:50:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:50:04,982 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-11-07 01:50:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:50:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 25 [2021-11-07 01:50:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:50:04,983 INFO L225 Difference]: With dead ends: 26 [2021-11-07 01:50:04,983 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:50:04,984 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:50:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:50:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:50:04,984 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) [2021-11-07 01:50:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:50:04,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-11-07 01:50:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:50:04,985 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:50:04,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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) [2021-11-07 01:50:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:50:04,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:50:04,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:04,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:04,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:04,988 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:50:05,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:50:05,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:50:05,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:50:05,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:05,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:50:08,146 INFO L857 garLoopResultBuilder]: For program point L60(lines 60 93) no Hoare annotation was computed. [2021-11-07 01:50:08,146 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-11-07 01:50:08,146 INFO L853 garLoopResultBuilder]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-11-07 01:50:08,147 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 01:50:08,147 INFO L853 garLoopResultBuilder]: At program point L119(lines 98 128) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#main__array~0.offset| 0)) (.cse3 (= ~__tmp_155_0~0 1)) (.cse4 (= ~__return_136~0 0)) (.cse5 (= ULTIMATE.start_main_~main__loop_entered~0 1)) (.cse6 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse8 (= |#NULL.offset| 0)) (.cse9 (= |#t~string6.offset| 0)) (.cse10 (= ~__return_main~0 0)) (.cse11 (= 0 |#t~string4.offset|)) (.cse12 (= |#NULL.base| 0))) (or (let ((.cse7 (select |#memory_int| |#t~string4.base|)) (.cse2 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_2~0 4294967296)) (.cse1 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 4294967296))) (and (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 ~__tmp_155_0~0) (< |#StackHeapBarrier| |#t~string6.base|) .cse0 (= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 1)) (< .cse1 .cse2) (<= (mod ULTIMATE.start_main_~main__index2~0 4294967296) (mod ULTIMATE.start_main_~main__index1~0 4294967296)) (= (+ ULTIMATE.start_main_~main__index2~0 1) ULTIMATE.start_main_~main____CPAchecker_TMP_2~0) (< |#StackHeapBarrier| |#t~string5.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0.base|) .cse3 (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= (select |#valid| |#t~string6.base|) 1) .cse4 (= (select |#valid| |ULTIMATE.start_main_~#main__array~0.base|) 1) (= ~__tmp_155_0~0 ULTIMATE.start_main_~__tmp_1~0) (= (select |#valid| 0) 0) .cse5 .cse6 (< |#StackHeapBarrier| |#t~string4.base|) (= (select |#length| |#t~string6.base|) 12) (= (select .cse7 (+ 1 |#t~string4.offset|)) 0) .cse8 .cse9 (= (select |#length| |ULTIMATE.start_main_~#main__array~0.base|) 400000) (= (select |#length| |#t~string4.base|) 2) (= (select .cse7 |#t~string4.offset|) 48) (< .cse2 100000) .cse10 (= 45 (select |#length| |#t~string5.base|)) .cse11 (< 0 |#StackHeapBarrier|) .cse12 (= (mod (let ((.cse13 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (+ (* (mod (select .cse13 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse2 4))) 4294967296) 4294967295) (select .cse13 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse1 4))))) 4294967296) 0))) (and (<= 0 |#t~string4.base|) .cse0 (<= 1 ULTIMATE.start_main_~main____CPAchecker_TMP_0~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse3 (<= 0 |#t~string5.base|) (<= 0 |#t~string5.offset|) .cse4 (<= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) (<= 0 |#t~string6.base|) (<= 1 ULTIMATE.start_main_~__tmp_1~0) (<= 0 |ULTIMATE.start_main_~#main__array~0.base|) (<= ULTIMATE.start_main_~__tmp_1~0 1) .cse5 .cse6 .cse8 .cse9 (<= 0 |#StackHeapBarrier|) .cse10 (<= |#t~string5.offset| 0) .cse11 .cse12))) [2021-11-07 01:50:08,147 INFO L860 garLoopResultBuilder]: At program point L194(lines 14 196) the Hoare annotation is: true [2021-11-07 01:50:08,147 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 88) no Hoare annotation was computed. [2021-11-07 01:50:08,147 INFO L857 garLoopResultBuilder]: For program point L29(lines 29 152) no Hoare annotation was computed. [2021-11-07 01:50:08,148 INFO L853 garLoopResultBuilder]: At program point L87(lines 62 88) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |#t~string4.base|)) (.cse1 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_2~0 4294967296)) (.cse0 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 4294967296))) (and (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 ~__tmp_155_0~0) (< |#StackHeapBarrier| |#t~string6.base|) (= |ULTIMATE.start_main_~#main__array~0.offset| 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)) ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 1)) (< .cse0 .cse1) (= (+ ULTIMATE.start_main_~main__index2~0 1) ULTIMATE.start_main_~main____CPAchecker_TMP_2~0) (< |#StackHeapBarrier| |#t~string5.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0.base|) (= ~__tmp_155_0~0 1) (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= (select |#valid| |#t~string6.base|) 1) (= ~__return_136~0 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0.base|) 1) (= ~__tmp_155_0~0 ULTIMATE.start_main_~__tmp_1~0) (= (select |#valid| 0) 0) (= ULTIMATE.start_main_~main__loop_entered~0 1) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (< |#StackHeapBarrier| |#t~string4.base|) (= (select |#length| |#t~string6.base|) 12) (= (select .cse2 (+ 1 |#t~string4.offset|)) 0) (= |#NULL.offset| 0) (= |#t~string6.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#main__array~0.base|) 400000) (= (select |#length| |#t~string4.base|) 2) (= (select .cse2 |#t~string4.offset|) 48) (< .cse1 100000) (= ~__return_main~0 0) (= 45 (select |#length| |#t~string5.base|)) (= 0 |#t~string4.offset|) (< 0 |#StackHeapBarrier|) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 1) (= |#NULL.base| 0) (= (mod (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (+ (* (mod (select .cse3 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse1 4))) 4294967296) 4294967295) (select .cse3 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse0 4))))) 4294967296) 0))) [2021-11-07 01:50:08,148 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 167) no Hoare annotation was computed. [2021-11-07 01:50:08,148 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 195) no Hoare annotation was computed. [2021-11-07 01:50:08,149 INFO L853 garLoopResultBuilder]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse27 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1)) (.cse32 (select |#memory_int| |#t~string4.base|))) (let ((.cse0 (< |#StackHeapBarrier| |#t~string6.base|)) (.cse1 (= |ULTIMATE.start_main_~#main__array~0.offset| 0)) (.cse4 (< |#StackHeapBarrier| |#t~string5.base|)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0.base|)) (.cse6 (= (select |#valid| |#t~string5.base|) 1)) (.cse7 (= (select |#valid| |#t~string4.base|) 1)) (.cse8 (= (select |#valid| |#t~string6.base|) 1)) (.cse9 (= ~__return_136~0 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_main_~#main__array~0.base|) 1)) (.cse11 (= (select |#valid| 0) 0)) (.cse12 (< |#StackHeapBarrier| |#t~string4.base|)) (.cse13 (= (select |#length| |#t~string6.base|) 12)) (.cse14 (= (select .cse32 (+ 1 |#t~string4.offset|)) 0)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (= |#t~string6.offset| 0)) (.cse17 (= (select |#length| |ULTIMATE.start_main_~#main__array~0.base|) 400000)) (.cse18 (= (select |#length| |#t~string4.base|) 2)) (.cse19 (= (select .cse32 |#t~string4.offset|) 48)) (.cse20 (= ~__return_main~0 0)) (.cse21 (= 45 (select |#length| |#t~string5.base|))) (.cse22 (= 0 |#t~string4.offset|)) (.cse23 (< 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0)) (.cse25 (let ((.cse31 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (let ((.cse28 (<= (+ .cse31 ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296))))) (.cse29 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse31 99999))) (.cse30 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1))) (or (and .cse28 .cse29 .cse27 .cse30) (and .cse28 .cse29 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) .cse30 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)))))))) (or (let ((.cse3 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_2~0 4294967296)) (.cse2 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 4294967296))) (and (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 ~__tmp_155_0~0) .cse0 .cse1 (= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 1)) (< .cse2 .cse3) (= (+ ULTIMATE.start_main_~main__index2~0 1) ULTIMATE.start_main_~main____CPAchecker_TMP_2~0) .cse4 .cse5 (= ~__tmp_155_0~0 1) .cse6 .cse7 (= |#t~string5.offset| 0) .cse8 .cse9 .cse10 (= ~__tmp_155_0~0 ULTIMATE.start_main_~__tmp_1~0) .cse11 (= ULTIMATE.start_main_~main__loop_entered~0 1) .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_main_~__tmp_2~0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1) .cse16 .cse17 .cse18 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 ULTIMATE.start_main_~__tmp_2~0) .cse19 (< .cse3 100000) .cse20 .cse21 .cse22 .cse23 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 1) .cse24 .cse25 (= (mod (let ((.cse26 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (+ (* (mod (select .cse26 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse3 4))) 4294967296) 4294967295) (select .cse26 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse2 4))))) 4294967296) 0))) (and .cse0 .cse1 (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ~__tmp_155_0~0 1) .cse4 .cse27 .cse5 .cse6 .cse7 (<= 0 |#t~string5.offset|) .cse8 .cse9 (<= 1 ~__tmp_155_0~0) .cse10 (<= 1 ULTIMATE.start_main_~__tmp_1~0) .cse11 (<= ULTIMATE.start_main_~__tmp_1~0 1) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |#t~string5.offset| 0) .cse22 .cse23 .cse24 .cse25)))) [2021-11-07 01:50:08,149 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 80) no Hoare annotation was computed. [2021-11-07 01:50:08,149 INFO L853 garLoopResultBuilder]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (.cse1 (select |#memory_int| |#t~string4.base|))) (and (< |#StackHeapBarrier| |#t~string6.base|) (= |ULTIMATE.start_main_~#main__array~0.offset| 0) (<= (+ .cse0 ULTIMATE.start_main_~main__index1~0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ~__tmp_155_0~0 0) (< |#StackHeapBarrier| |#t~string5.base|) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0.base|) (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= (select |#valid| |#t~string6.base|) 1) (= ~__return_136~0 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0.base|) 1) (= (select |#valid| 0) 0) (< |#StackHeapBarrier| |#t~string4.base|) (= (select |#length| |#t~string6.base|) 12) (= (select .cse1 (+ 1 |#t~string4.offset|)) 0) (= |#NULL.offset| 0) (= |#t~string6.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#main__array~0.base|) 400000) (= (select |#length| |#t~string4.base|) 2) (= (select .cse1 |#t~string4.offset|) 48) (= ~__return_main~0 0) (= 45 (select |#length| |#t~string5.base|)) (= 0 |#t~string4.offset|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-07 01:50:08,149 INFO L857 garLoopResultBuilder]: For program point L97(lines 97 132) no Hoare annotation was computed. [2021-11-07 01:50:08,149 INFO L857 garLoopResultBuilder]: For program point L31(lines 31 147) no Hoare annotation was computed. [2021-11-07 01:50:08,150 INFO L853 garLoopResultBuilder]: At program point L172(lines 26 185) the Hoare annotation is: (let ((.cse0 (mod ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse1 (mod ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse5 (select |#memory_int| |#t~string4.base|)) (.cse3 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_2~0 4294967296)) (.cse4 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|)) (.cse2 (mod ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 4294967296))) (and (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 ~__tmp_155_0~0) (< |#StackHeapBarrier| |#t~string6.base|) (= |ULTIMATE.start_main_~#main__array~0.offset| 0) (< .cse0 .cse1) (= ULTIMATE.start_main_~__tmp_3~0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) (= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main____CPAchecker_TMP_1~0 1)) (< .cse2 .cse3) (= ULTIMATE.start_main_~__tmp_3~0 (ite (= (mod (select .cse4 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))) 4))) 4294967296) (mod (select .cse4 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* (ite (<= .cse1 2147483647) .cse1 (+ (- 4294967296) .cse1)) 4))) 4294967296)) 1 0)) (= (+ ULTIMATE.start_main_~main__index2~0 1) ULTIMATE.start_main_~main____CPAchecker_TMP_2~0) (< |#StackHeapBarrier| |#t~string5.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0.base|) (= ~__tmp_155_0~0 1) (= (select |#valid| |#t~string5.base|) 1) (= (select |#valid| |#t~string4.base|) 1) (= |#t~string5.offset| 0) (= (select |#valid| |#t~string6.base|) 1) (= ~__return_136~0 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0.base|) 1) (= ~__tmp_155_0~0 ULTIMATE.start_main_~__tmp_1~0) (= (select |#valid| 0) 0) (= ULTIMATE.start_main_~main__loop_entered~0 1) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (< |#StackHeapBarrier| |#t~string4.base|) (= (select |#length| |#t~string6.base|) 12) (= (select .cse5 (+ 1 |#t~string4.offset|)) 0) (= |#NULL.offset| 0) (= |#t~string6.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#main__array~0.base|) 400000) (= (select |#length| |#t~string4.base|) 2) (= (select .cse5 |#t~string4.offset|) 48) (< .cse3 100000) (= ~__return_main~0 0) (= 45 (select |#length| |#t~string5.base|)) (= 0 |#t~string4.offset|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (mod (+ (* (mod (select .cse4 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse3 4))) 4294967296) 4294967295) (select .cse4 (+ |ULTIMATE.start_main_~#main__array~0.offset| (* .cse2 4)))) 4294967296) 0))) [2021-11-07 01:50:08,150 INFO L857 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-11-07 01:50:08,150 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 139) no Hoare annotation was computed. [2021-11-07 01:50:08,150 INFO L860 garLoopResultBuilder]: At program point L131(lines 97 132) the Hoare annotation is: true [2021-11-07 01:50:08,150 INFO L857 garLoopResultBuilder]: For program point L156(lines 156 184) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 133) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 190) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 120) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point L165(lines 165 173) no Hoare annotation was computed. [2021-11-07 01:50:08,151 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:50:08,152 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 138) no Hoare annotation was computed. [2021-11-07 01:50:08,152 INFO L857 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2021-11-07 01:50:08,152 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 179) no Hoare annotation was computed. [2021-11-07 01:50:08,152 INFO L853 garLoopResultBuilder]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-11-07 01:50:08,152 INFO L857 garLoopResultBuilder]: For program point L26(lines 26 185) no Hoare annotation was computed. [2021-11-07 01:50:08,152 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2021-11-07 01:50:08,153 INFO L857 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2021-11-07 01:50:08,153 INFO L857 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2021-11-07 01:50:08,156 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:50:08,157 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:50:08,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:50:08 BoogieIcfgContainer [2021-11-07 01:50:08,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:50:08,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:50:08,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:50:08,205 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:50:08,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:42" (3/4) ... [2021-11-07 01:50:08,208 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:50:08,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-07 01:50:08,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-07 01:50:08,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:50:08,220 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:50:08,274 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:50:08,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:50:08,275 INFO L168 Benchmark]: Toolchain (without parser) took 26175.40 ms. Allocated memory was 94.4 MB in the beginning and 188.7 MB in the end (delta: 94.4 MB). Free memory was 57.2 MB in the beginning and 84.8 MB in the end (delta: -27.6 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,275 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 94.4 MB. Free memory was 73.6 MB in the beginning and 73.6 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:50:08,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.05 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 57.0 MB in the beginning and 100.4 MB in the end (delta: -43.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.19 ms. Allocated memory is still 125.8 MB. Free memory was 100.4 MB in the beginning and 98.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,277 INFO L168 Benchmark]: Boogie Preprocessor took 27.29 ms. Allocated memory is still 125.8 MB. Free memory was 98.4 MB in the beginning and 97.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:50:08,277 INFO L168 Benchmark]: RCFGBuilder took 430.00 ms. Allocated memory is still 125.8 MB. Free memory was 97.2 MB in the beginning and 83.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,277 INFO L168 Benchmark]: TraceAbstraction took 25267.00 ms. Allocated memory was 125.8 MB in the beginning and 188.7 MB in the end (delta: 62.9 MB). Free memory was 82.9 MB in the beginning and 91.1 MB in the end (delta: -8.2 MB). Peak memory consumption was 94.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,278 INFO L168 Benchmark]: Witness Printer took 69.51 ms. Allocated memory is still 188.7 MB. Free memory was 91.1 MB in the beginning and 84.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:50:08,280 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.24 ms. Allocated memory is still 94.4 MB. Free memory was 73.6 MB in the beginning and 73.6 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 320.05 ms. Allocated memory was 94.4 MB in the beginning and 125.8 MB in the end (delta: 31.5 MB). Free memory was 57.0 MB in the beginning and 100.4 MB in the end (delta: -43.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.19 ms. Allocated memory is still 125.8 MB. Free memory was 100.4 MB in the beginning and 98.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.29 ms. Allocated memory is still 125.8 MB. Free memory was 98.4 MB in the beginning and 97.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 430.00 ms. Allocated memory is still 125.8 MB. Free memory was 97.2 MB in the beginning and 83.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25267.00 ms. Allocated memory was 125.8 MB in the beginning and 188.7 MB in the end (delta: 62.9 MB). Free memory was 82.9 MB in the beginning and 91.1 MB in the end (delta: -8.2 MB). Peak memory consumption was 94.0 MB. Max. memory is 16.1 GB. * Witness Printer took 69.51 ms. Allocated memory is still 188.7 MB. Free memory was 91.1 MB in the beginning and 84.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * 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: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 109]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 167]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 25.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 174 SDtfs, 217 SDslu, 211 SDs, 0 SdLazy, 325 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 108 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 21 NumberOfFragments, 1243 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1399 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 885 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 4334 SizeOfPredicates, 4 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/21 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[ms]: 2308, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 37, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 51, TOOLS_POST_TIME[ms]: 919, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME[ms]: 894, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 213, FLUID_QUERY_TIME[ms]: 8, FLUID_QUERIES: 96, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME[ms]: 1031, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 16, DOMAIN_ISBOTTOM_APPLICATIONS: 37, DOMAIN_ISBOTTOM_TIME[ms]: 245, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 308, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 308, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 27, DAG_COMPRESSION_PROCESSED_NODES: 475, DAG_COMPRESSION_RETAINED_NODES: 105, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == __tmp_155_0 && unknown-#StackHeapBarrier-unknown < "reach_error") && main__array == 0) && main__index1 == main____CPAchecker_TMP_1 + 1) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && main__index2 % 4294967296 <= main__index1 % 4294967296) && main__index2 + 1 == main____CPAchecker_TMP_2) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && unknown-#StackHeapBarrier-unknown < main__array) && __tmp_155_0 == 1) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && "simple_array_index_value_4.i.v+lhb-reducer.c" == 0) && \valid["reach_error"] == 1) && __return_136 == 0) && \valid[main__array] == 1) && __tmp_155_0 == __tmp_1) && \valid[0] == 0) && main__loop_entered == 1) && __VERIFIER_assert__cond == 1) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && unknown-#memory_int-unknown["0"]["0"] == 48) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && (unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296 * 4294967295 + unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4]) % 4294967296 == 0) || (((((((((((((((((((((0 <= "0" && main__array == 0) && 1 <= main____CPAchecker_TMP_0) && !(__VERIFIER_assert__cond == 0)) && __tmp_155_0 == 1) && 0 <= "simple_array_index_value_4.i.v+lhb-reducer.c") && 0 <= "simple_array_index_value_4.i.v+lhb-reducer.c") && __return_136 == 0) && main____CPAchecker_TMP_0 <= 1) && 0 <= "reach_error") && 1 <= __tmp_1) && 0 <= main__array) && __tmp_1 <= 1) && main__loop_entered == 1) && __VERIFIER_assert__cond == 1) && #NULL == 0) && "reach_error" == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && __return_main == 0) && "simple_array_index_value_4.i.v+lhb-reducer.c" <= 0) && 0 == "0") && #NULL == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < "reach_error" && main__array == 0) && 4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __tmp_155_0 == 0) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && main____CPAchecker_TMP_0 == 1) && unknown-#StackHeapBarrier-unknown < main__array) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && "simple_array_index_value_4.i.v+lhb-reducer.c" == 0) && \valid["reach_error"] == 1) && __return_136 == 0) && \valid[main__array] == 1) && \valid[0] == 0) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && unknown-#memory_int-unknown["0"]["0"] == 48) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == __tmp_155_0 && unknown-#StackHeapBarrier-unknown < "reach_error") && main__array == 0) && main__index1 == main____CPAchecker_TMP_1 + 1) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && main__index2 + 1 == main____CPAchecker_TMP_2) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && unknown-#StackHeapBarrier-unknown < main__array) && __tmp_155_0 == 1) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && "simple_array_index_value_4.i.v+lhb-reducer.c" == 0) && \valid["reach_error"] == 1) && __return_136 == 0) && \valid[main__array] == 1) && __tmp_155_0 == __tmp_1) && \valid[0] == 0) && main__loop_entered == 1) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && __tmp_2 == __VERIFIER_assert__cond) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && main____CPAchecker_TMP_0 == __tmp_2) && unknown-#memory_int-unknown["0"]["0"] == 48) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && main____CPAchecker_TMP_0 == 1) && #NULL == 0) && ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) || ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(main____CPAchecker_TMP_0 == 0)))) && (unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296 * 4294967295 + unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4]) % 4294967296 == 0) || (((((((((((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < "reach_error" && main__array == 0) && main__loop_entered == 0) && __tmp_155_0 <= 1) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && main____CPAchecker_TMP_0 == 1) && unknown-#StackHeapBarrier-unknown < main__array) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && 0 <= "simple_array_index_value_4.i.v+lhb-reducer.c") && \valid["reach_error"] == 1) && __return_136 == 0) && 1 <= __tmp_155_0) && \valid[main__array] == 1) && 1 <= __tmp_1) && \valid[0] == 0) && __tmp_1 <= 1) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && unknown-#memory_int-unknown["0"]["0"] == 48) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && "simple_array_index_value_4.i.v+lhb-reducer.c" <= 0) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) || ((((4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(main____CPAchecker_TMP_0 == 0)))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == __tmp_155_0 && unknown-#StackHeapBarrier-unknown < "reach_error") && main__array == 0) && 4294967296 * (main__index2 / 4294967296) + main__index1 + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index1 == main____CPAchecker_TMP_1 + 1) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && main__index2 + 1 == main____CPAchecker_TMP_2) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && unknown-#StackHeapBarrier-unknown < main__array) && __tmp_155_0 == 1) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && "simple_array_index_value_4.i.v+lhb-reducer.c" == 0) && \valid["reach_error"] == 1) && __return_136 == 0) && \valid[main__array] == 1) && __tmp_155_0 == __tmp_1) && \valid[0] == 0) && main__loop_entered == 1) && __VERIFIER_assert__cond == 1) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && unknown-#memory_int-unknown["0"]["0"] == 48) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && main____CPAchecker_TMP_0 == 1) && #NULL == 0) && (unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296 * 4294967295 + unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4]) % 4294967296 == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == __tmp_155_0 && unknown-#StackHeapBarrier-unknown < "reach_error") && main__array == 0) && main__index2 % 4294967296 < main__index1 % 4294967296) && __tmp_3 == __VERIFIER_assert__cond) && main__index1 == main____CPAchecker_TMP_1 + 1) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && __tmp_3 == (if unknown-#memory_int-unknown[main__array][main__array + (if main__index2 % 4294967296 <= 2147483647 then main__index2 % 4294967296 else main__index2 % 4294967296 + -4294967296) * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + (if main__index1 % 4294967296 <= 2147483647 then main__index1 % 4294967296 else -4294967296 + main__index1 % 4294967296) * 4] % 4294967296 then 1 else 0)) && main__index2 + 1 == main____CPAchecker_TMP_2) && unknown-#StackHeapBarrier-unknown < "simple_array_index_value_4.i.v+lhb-reducer.c") && unknown-#StackHeapBarrier-unknown < main__array) && __tmp_155_0 == 1) && \valid["simple_array_index_value_4.i.v+lhb-reducer.c"] == 1) && \valid["0"] == 1) && "simple_array_index_value_4.i.v+lhb-reducer.c" == 0) && \valid["reach_error"] == 1) && __return_136 == 0) && \valid[main__array] == 1) && __tmp_155_0 == __tmp_1) && \valid[0] == 0) && main__loop_entered == 1) && __VERIFIER_assert__cond == 1) && unknown-#StackHeapBarrier-unknown < "0") && unknown-#length-unknown["reach_error"] == 12) && unknown-#memory_int-unknown["0"][1 + "0"] == 0) && #NULL == 0) && "reach_error" == 0) && unknown-#length-unknown[main__array] == 400000) && unknown-#length-unknown["0"] == 2) && unknown-#memory_int-unknown["0"]["0"] == 48) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && __return_main == 0) && 45 == unknown-#length-unknown["simple_array_index_value_4.i.v+lhb-reducer.c"]) && 0 == "0") && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && (unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296 * 4294967295 + unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4]) % 4294967296 == 0 RESULT: Ultimate proved your program to be correct! [2021-11-07 01:50:08,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f9f7ff0-4445-48f9-8206-60d27cf13a88/bin/utaipan-UUZaoUuFF8/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