java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/minepump_spec3_product37.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:49:31,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:49:31,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:49:31,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:49:31,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:49:31,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:49:31,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:49:31,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:49:31,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:49:31,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:49:31,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:49:31,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:49:31,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:49:31,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:49:31,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:49:31,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:49:31,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:49:31,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:49:31,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:49:31,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:49:31,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:49:31,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:49:31,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:49:31,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:49:31,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:49:31,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:49:31,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:49:31,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:49:31,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:49:31,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:49:31,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:49:31,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:49:31,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:49:31,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:49:31,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:49:31,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:49:31,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:49:31,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:49:31,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:49:31,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:49:31,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:49:31,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:49:31,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:49:31,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:49:31,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:49:31,757 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:49:31,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:49:31,758 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:49:31,758 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:49:31,758 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:49:31,758 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:49:31,759 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:49:31,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:49:31,762 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:49:31,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:49:31,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:49:31,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:49:31,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:49:31,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:49:31,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:49:31,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:49:31,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:49:31,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:49:31,765 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:49:31,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:49:31,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:49:31,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:49:31,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:49:31,766 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:49:31,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:49:31,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:49:31,767 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:49:31,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:49:31,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:49:31,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:49:31,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:49:31,847 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:49:31,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec3_product37.cil.c [2019-09-10 02:49:31,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7107de9aa/1ed4b26e83f348a0ae19fdac54134369/FLAG6b274aa6b [2019-09-10 02:49:32,442 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:49:32,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec3_product37.cil.c [2019-09-10 02:49:32,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7107de9aa/1ed4b26e83f348a0ae19fdac54134369/FLAG6b274aa6b [2019-09-10 02:49:32,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7107de9aa/1ed4b26e83f348a0ae19fdac54134369 [2019-09-10 02:49:32,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:49:32,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:49:32,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:49:32,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:49:32,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:49:32,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:49:32" (1/1) ... [2019-09-10 02:49:32,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7075e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:32, skipping insertion in model container [2019-09-10 02:49:32,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:49:32" (1/1) ... [2019-09-10 02:49:32,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:49:32,757 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:49:33,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:49:33,194 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:49:33,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:49:33,369 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:49:33,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33 WrapperNode [2019-09-10 02:49:33,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:49:33,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:49:33,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:49:33,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:49:33,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... [2019-09-10 02:49:33,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:49:33,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:49:33,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:49:33,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:49:33,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:49:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:49:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:49:33,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:49:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:49:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:49:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2019-09-10 02:49:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2019-09-10 02:49:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure printPump [2019-09-10 02:49:33,509 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2019-09-10 02:49:33,510 INFO L138 BoogieDeclarations]: Found implementation of procedure printEnvironment [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:49:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:49:33,512 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:49:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:49:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:49:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:49:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:49:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure printPump [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:49:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:49:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:49:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:49:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2019-09-10 02:49:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure printEnvironment [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-10 02:49:33,518 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:49:33,519 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:49:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:49:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:49:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:49:34,636 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:49:34,636 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-10 02:49:34,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:49:34 BoogieIcfgContainer [2019-09-10 02:49:34,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:49:34,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:49:34,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:49:34,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:49:34,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:49:32" (1/3) ... [2019-09-10 02:49:34,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3068ba85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:49:34, skipping insertion in model container [2019-09-10 02:49:34,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:49:33" (2/3) ... [2019-09-10 02:49:34,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3068ba85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:49:34, skipping insertion in model container [2019-09-10 02:49:34,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:49:34" (3/3) ... [2019-09-10 02:49:34,647 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product37.cil.c [2019-09-10 02:49:34,657 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:49:34,666 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:49:34,684 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:49:34,718 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:49:34,718 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:49:34,719 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:49:34,719 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:49:34,719 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:49:34,719 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:49:34,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:49:34,720 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:49:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2019-09-10 02:49:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:49:34,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:34,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:34,776 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash -286818330, now seen corresponding path program 1 times [2019-09-10 02:49:34,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:34,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:34,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:35,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:35,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:49:35,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:35,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:49:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:49:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:49:35,156 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 2 states. [2019-09-10 02:49:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:35,202 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2019-09-10 02:49:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:49:35,205 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 52 [2019-09-10 02:49:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:35,232 INFO L225 Difference]: With dead ends: 140 [2019-09-10 02:49:35,233 INFO L226 Difference]: Without dead ends: 129 [2019-09-10 02:49:35,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:49:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-10 02:49:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-09-10 02:49:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-10 02:49:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-09-10 02:49:35,353 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 52 [2019-09-10 02:49:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:35,354 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-09-10 02:49:35,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:49:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-09-10 02:49:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 02:49:35,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:35,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:35,367 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2080874190, now seen corresponding path program 1 times [2019-09-10 02:49:35,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:35,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:35,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:35,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:49:35,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:35,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:49:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:49:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:49:35,513 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 3 states. [2019-09-10 02:49:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:35,536 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2019-09-10 02:49:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:49:35,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 02:49:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:35,542 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:49:35,543 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:49:35,544 INFO L628 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 [2019-09-10 02:49:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:49:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-10 02:49:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:49:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2019-09-10 02:49:35,563 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 53 [2019-09-10 02:49:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:35,564 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2019-09-10 02:49:35,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:49:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2019-09-10 02:49:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:49:35,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:35,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:35,571 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -655892717, now seen corresponding path program 1 times [2019-09-10 02:49:35,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:35,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:35,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:35,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:35,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:49:35,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:35,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:49:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:49:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:49:35,774 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 7 states. [2019-09-10 02:49:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:36,097 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2019-09-10 02:49:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:49:36,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-10 02:49:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:36,100 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:49:36,100 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:49:36,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:49:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:49:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-10 02:49:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:49:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-09-10 02:49:36,117 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 57 [2019-09-10 02:49:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:36,118 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-09-10 02:49:36,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:49:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-09-10 02:49:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 02:49:36,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:36,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:36,121 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1564257937, now seen corresponding path program 1 times [2019-09-10 02:49:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:36,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:36,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:36,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:36,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:49:36,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:36,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:49:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:49:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:49:36,282 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 5 states. [2019-09-10 02:49:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:36,899 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-09-10 02:49:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:49:36,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 02:49:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:36,903 INFO L225 Difference]: With dead ends: 226 [2019-09-10 02:49:36,903 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 02:49:36,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:49:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 02:49:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 208. [2019-09-10 02:49:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 02:49:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2019-09-10 02:49:36,937 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 70 [2019-09-10 02:49:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:36,938 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2019-09-10 02:49:36,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:49:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2019-09-10 02:49:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 02:49:36,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:36,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:36,941 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1686316557, now seen corresponding path program 1 times [2019-09-10 02:49:36,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:36,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:49:37,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:37,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:49:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:49:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:49:37,086 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand 6 states. [2019-09-10 02:49:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:37,301 INFO L93 Difference]: Finished difference Result 320 states and 372 transitions. [2019-09-10 02:49:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:49:37,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 02:49:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:37,310 INFO L225 Difference]: With dead ends: 320 [2019-09-10 02:49:37,310 INFO L226 Difference]: Without dead ends: 320 [2019-09-10 02:49:37,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:49:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-10 02:49:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2019-09-10 02:49:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-10 02:49:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 368 transitions. [2019-09-10 02:49:37,349 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 368 transitions. Word has length 84 [2019-09-10 02:49:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:37,349 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 368 transitions. [2019-09-10 02:49:37,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:49:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 368 transitions. [2019-09-10 02:49:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:49:37,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:37,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:37,352 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash 645528839, now seen corresponding path program 1 times [2019-09-10 02:49:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:37,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:37,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:49:37,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:37,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:49:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:49:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:49:37,479 INFO L87 Difference]: Start difference. First operand 316 states and 368 transitions. Second operand 6 states. [2019-09-10 02:49:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:37,785 INFO L93 Difference]: Finished difference Result 495 states and 592 transitions. [2019-09-10 02:49:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:49:37,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-09-10 02:49:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:37,789 INFO L225 Difference]: With dead ends: 495 [2019-09-10 02:49:37,789 INFO L226 Difference]: Without dead ends: 495 [2019-09-10 02:49:37,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:49:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-10 02:49:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 477. [2019-09-10 02:49:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-10 02:49:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 569 transitions. [2019-09-10 02:49:37,815 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 569 transitions. Word has length 88 [2019-09-10 02:49:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:37,815 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 569 transitions. [2019-09-10 02:49:37,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:49:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 569 transitions. [2019-09-10 02:49:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:49:37,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:37,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:37,818 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash -277154744, now seen corresponding path program 1 times [2019-09-10 02:49:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:49:37,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:37,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:49:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:49:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:49:37,888 INFO L87 Difference]: Start difference. First operand 477 states and 569 transitions. Second operand 5 states. [2019-09-10 02:49:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:37,906 INFO L93 Difference]: Finished difference Result 487 states and 579 transitions. [2019-09-10 02:49:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:49:37,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 02:49:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:37,910 INFO L225 Difference]: With dead ends: 487 [2019-09-10 02:49:37,911 INFO L226 Difference]: Without dead ends: 487 [2019-09-10 02:49:37,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:49:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-10 02:49:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-09-10 02:49:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 02:49:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 572 transitions. [2019-09-10 02:49:37,932 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 572 transitions. Word has length 88 [2019-09-10 02:49:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:37,933 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 572 transitions. [2019-09-10 02:49:37,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:49:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 572 transitions. [2019-09-10 02:49:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:49:37,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:37,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:37,935 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1121160246, now seen corresponding path program 1 times [2019-09-10 02:49:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:37,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:38,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:38,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:49:38,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:38,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:49:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:49:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:49:38,086 INFO L87 Difference]: Start difference. First operand 481 states and 572 transitions. Second operand 9 states. [2019-09-10 02:49:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:38,142 INFO L93 Difference]: Finished difference Result 487 states and 579 transitions. [2019-09-10 02:49:38,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:49:38,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 02:49:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:38,146 INFO L225 Difference]: With dead ends: 487 [2019-09-10 02:49:38,147 INFO L226 Difference]: Without dead ends: 487 [2019-09-10 02:49:38,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:49:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-10 02:49:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-09-10 02:49:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 02:49:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 570 transitions. [2019-09-10 02:49:38,170 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 570 transitions. Word has length 88 [2019-09-10 02:49:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:38,170 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 570 transitions. [2019-09-10 02:49:38,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:49:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 570 transitions. [2019-09-10 02:49:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:49:38,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:38,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:38,173 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1811416500, now seen corresponding path program 1 times [2019-09-10 02:49:38,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:38,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:38,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:38,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:49:38,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:49:38,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:49:38,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:38,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:49:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:49:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:49:38,308 INFO L87 Difference]: Start difference. First operand 481 states and 570 transitions. Second operand 10 states. [2019-09-10 02:49:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:38,649 INFO L93 Difference]: Finished difference Result 487 states and 564 transitions. [2019-09-10 02:49:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:49:38,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 02:49:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:38,652 INFO L225 Difference]: With dead ends: 487 [2019-09-10 02:49:38,652 INFO L226 Difference]: Without dead ends: 487 [2019-09-10 02:49:38,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:49:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-10 02:49:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 470. [2019-09-10 02:49:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 02:49:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 539 transitions. [2019-09-10 02:49:38,668 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 539 transitions. Word has length 89 [2019-09-10 02:49:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:38,669 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 539 transitions. [2019-09-10 02:49:38,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:49:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 539 transitions. [2019-09-10 02:49:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:49:38,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:49:38,672 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:49:38,672 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:49:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1818347036, now seen corresponding path program 1 times [2019-09-10 02:49:38,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:49:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:49:38,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:49:38,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:49:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:49:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:49:38,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:49:38,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:49:38,744 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 02:49:38,747 INFO L207 CegarAbsIntRunner]: [50], [51], [52], [56], [59], [83], [99], [102], [104], [105], [108], [110], [113], [120], [123], [125], [134], [138], [142], [145], [148], [150], [156], [158], [161], [185], [186], [187], [189], [192], [196], [197], [198], [199], [202], [205], [209], [215], [242], [243], [246], [250], [251], [254], [256], [259], [269], [272], [276], [277], [280], [281], [282], [305], [307], [308], [309], [310], [375], [376], [386], [388], [391], [393], [395], [398], [400], [405], [411], [412], [420], [421], [422], [423], [424], [425], [426], [427], [428], [460], [461], [462], [463], [466], [467], [468], [469], [472], [473], [476], [477], [478], [479], [480], [481], [482], [483], [488], [489], [490], [491], [498], [500], [501], [506], [507], [508], [509], [510], [511], [512], [514], [515], [516] [2019-09-10 02:49:38,788 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:49:38,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:49:38,858 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:49:38,860 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 0. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 126 variables. [2019-09-10 02:49:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:49:38,864 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:49:38,911 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:49:38,911 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:49:38,915 INFO L420 sIntCurrentIteration]: We unified 135 AI predicates to 135 [2019-09-10 02:49:38,916 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:49:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:49:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:49:38,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:49:38,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:49:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:49:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:49:38,918 INFO L87 Difference]: Start difference. First operand 470 states and 539 transitions. Second operand 2 states. [2019-09-10 02:49:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:49:38,918 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:49:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:49:38,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 136 [2019-09-10 02:49:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:49:38,919 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:49:38,919 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:49:38,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:49:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:49:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:49:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:49:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:49:38,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2019-09-10 02:49:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:49:38,920 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:49:38,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:49:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:49:38,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:49:38,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:49:38 BoogieIcfgContainer [2019-09-10 02:49:38,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:49:38,929 INFO L168 Benchmark]: Toolchain (without parser) took 6234.38 ms. Allocated memory was 134.2 MB in the beginning and 308.3 MB in the end (delta: 174.1 MB). Free memory was 89.2 MB in the beginning and 210.2 MB in the end (delta: -121.0 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:49:38,929 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:49:38,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.43 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.8 MB in the beginning and 165.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:49:38,932 INFO L168 Benchmark]: Boogie Preprocessor took 78.15 ms. Allocated memory is still 200.8 MB. Free memory was 165.8 MB in the beginning and 161.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:49:38,934 INFO L168 Benchmark]: RCFGBuilder took 1189.68 ms. Allocated memory was 200.8 MB in the beginning and 227.5 MB in the end (delta: 26.7 MB). Free memory was 161.4 MB in the beginning and 193.2 MB in the end (delta: -31.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:49:38,939 INFO L168 Benchmark]: TraceAbstraction took 4286.92 ms. Allocated memory was 227.5 MB in the beginning and 308.3 MB in the end (delta: 80.7 MB). Free memory was 193.2 MB in the beginning and 210.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:49:38,949 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.43 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.8 MB in the beginning and 165.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.15 ms. Allocated memory is still 200.8 MB. Free memory was 165.8 MB in the beginning and 161.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1189.68 ms. Allocated memory was 200.8 MB in the beginning and 227.5 MB in the end (delta: 26.7 MB). Free memory was 161.4 MB in the beginning and 193.2 MB in the end (delta: -31.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4286.92 ms. Allocated memory was 227.5 MB in the beginning and 308.3 MB in the end (delta: 80.7 MB). Free memory was 193.2 MB in the beginning and 210.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 860]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 38 procedures, 228 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1385 SDtfs, 620 SDslu, 4314 SDs, 0 SdLazy, 700 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.9185185185185185 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 69 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 795 ConstructedInterpolants, 0 QuantifiedInterpolants, 99126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 28/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...