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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:26,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:26,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:26,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:26,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:26,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:26,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:26,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:26,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:26,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:26,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:26,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:26,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:26,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:26,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:26,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:26,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:26,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:26,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:26,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:26,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:26,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:26,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:26,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:26,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:26,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:26,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:26,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:26,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:26,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:26,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:26,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:26,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:26,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:26,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:26,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:26,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:26,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:26,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:26,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:26,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:26,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:31:26,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:26,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:26,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:26,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:26,753 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:26,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:26,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:26,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:26,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:26,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:26,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:26,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:26,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:26,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:26,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:26,756 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:26,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:26,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:26,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:26,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:26,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:26,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:26,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:26,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:26,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:26,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:26,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:26,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:26,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:31:27,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:27,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:27,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:27,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:27,055 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:27,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-15 03:31:27,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9581fbfe/ec89f6437afe435a80711a21de4e5a61/FLAG12c16302b [2019-10-15 03:31:27,653 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:27,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-15 03:31:27,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9581fbfe/ec89f6437afe435a80711a21de4e5a61/FLAG12c16302b [2019-10-15 03:31:27,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9581fbfe/ec89f6437afe435a80711a21de4e5a61 [2019-10-15 03:31:27,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:27,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:27,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:27,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:27,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:27,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:27" (1/1) ... [2019-10-15 03:31:27,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df8c864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:27, skipping insertion in model container [2019-10-15 03:31:27,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:27" (1/1) ... [2019-10-15 03:31:27,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:28,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:28,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:28,275 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:28,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:28,445 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:28,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28 WrapperNode [2019-10-15 03:31:28,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:28,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:28,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:28,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:28,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (1/1) ... [2019-10-15 03:31:28,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:28,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:28,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:28,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:28,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (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-10-15 03:31:28,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 03:31:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-15 03:31:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-15 03:31:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-15 03:31:28,562 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 03:31:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 03:31:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 03:31:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 03:31:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 03:31:28,563 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 03:31:28,564 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 03:31:28,565 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 03:31:28,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:28,565 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-15 03:31:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 03:31:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:29,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:29,423 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 03:31:29,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:29 BoogieIcfgContainer [2019-10-15 03:31:29,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:29,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:29,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:29,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:29,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:27" (1/3) ... [2019-10-15 03:31:29,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90a4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:29, skipping insertion in model container [2019-10-15 03:31:29,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:28" (2/3) ... [2019-10-15 03:31:29,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b90a4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:29, skipping insertion in model container [2019-10-15 03:31:29,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:29" (3/3) ... [2019-10-15 03:31:29,433 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-10-15 03:31:29,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:29,452 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:29,463 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:29,488 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:29,488 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:29,488 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:29,488 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:29,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:29,489 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:29,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:29,489 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-10-15 03:31:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 03:31:29,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:29,521 INFO L380 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] [2019-10-15 03:31:29,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash -555226142, now seen corresponding path program 1 times [2019-10-15 03:31:29,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:29,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14015702] [2019-10-15 03:31:29,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:29,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14015702] [2019-10-15 03:31:29,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:29,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:29,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519659198] [2019-10-15 03:31:29,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:29,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:29,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:29,906 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2019-10-15 03:31:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:30,344 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2019-10-15 03:31:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:30,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-15 03:31:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:30,362 INFO L225 Difference]: With dead ends: 403 [2019-10-15 03:31:30,362 INFO L226 Difference]: Without dead ends: 260 [2019-10-15 03:31:30,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-15 03:31:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2019-10-15 03:31:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-15 03:31:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 321 transitions. [2019-10-15 03:31:30,511 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 321 transitions. Word has length 66 [2019-10-15 03:31:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:30,512 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 321 transitions. [2019-10-15 03:31:30,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 321 transitions. [2019-10-15 03:31:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 03:31:30,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:30,522 INFO L380 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] [2019-10-15 03:31:30,522 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1974924545, now seen corresponding path program 1 times [2019-10-15 03:31:30,523 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:30,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422135761] [2019-10-15 03:31:30,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:30,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:30,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422135761] [2019-10-15 03:31:30,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:30,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:30,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230274246] [2019-10-15 03:31:30,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:30,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:30,742 INFO L87 Difference]: Start difference. First operand 253 states and 321 transitions. Second operand 4 states. [2019-10-15 03:31:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:31,060 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2019-10-15 03:31:31,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:31,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-15 03:31:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:31,075 INFO L225 Difference]: With dead ends: 718 [2019-10-15 03:31:31,076 INFO L226 Difference]: Without dead ends: 481 [2019-10-15 03:31:31,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-10-15 03:31:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 458. [2019-10-15 03:31:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-15 03:31:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 573 transitions. [2019-10-15 03:31:31,158 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 573 transitions. Word has length 66 [2019-10-15 03:31:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:31,159 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 573 transitions. [2019-10-15 03:31:31,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 573 transitions. [2019-10-15 03:31:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 03:31:31,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:31,162 INFO L380 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] [2019-10-15 03:31:31,162 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash -53869737, now seen corresponding path program 1 times [2019-10-15 03:31:31,163 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:31,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922662919] [2019-10-15 03:31:31,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:31,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922662919] [2019-10-15 03:31:31,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:31,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:31:31,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584373909] [2019-10-15 03:31:31,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:31:31,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:31:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:31,390 INFO L87 Difference]: Start difference. First operand 458 states and 573 transitions. Second operand 6 states. [2019-10-15 03:31:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:31,537 INFO L93 Difference]: Finished difference Result 1196 states and 1548 transitions. [2019-10-15 03:31:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:31:31,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-15 03:31:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:31,546 INFO L225 Difference]: With dead ends: 1196 [2019-10-15 03:31:31,547 INFO L226 Difference]: Without dead ends: 755 [2019-10-15 03:31:31,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-15 03:31:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 731. [2019-10-15 03:31:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-15 03:31:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 927 transitions. [2019-10-15 03:31:31,618 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 927 transitions. Word has length 67 [2019-10-15 03:31:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:31,619 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 927 transitions. [2019-10-15 03:31:31,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:31:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 927 transitions. [2019-10-15 03:31:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:31:31,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:31,622 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 03:31:31,623 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash 712803888, now seen corresponding path program 1 times [2019-10-15 03:31:31,627 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:31,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086301700] [2019-10-15 03:31:31,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:31,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086301700] [2019-10-15 03:31:31,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:31,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:31:31,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676371357] [2019-10-15 03:31:31,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:31:31,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:31:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:31,896 INFO L87 Difference]: Start difference. First operand 731 states and 927 transitions. Second operand 8 states. [2019-10-15 03:31:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:33,352 INFO L93 Difference]: Finished difference Result 2380 states and 3439 transitions. [2019-10-15 03:31:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:31:33,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-10-15 03:31:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:33,370 INFO L225 Difference]: With dead ends: 2380 [2019-10-15 03:31:33,371 INFO L226 Difference]: Without dead ends: 1762 [2019-10-15 03:31:33,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:31:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-10-15 03:31:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1649. [2019-10-15 03:31:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-10-15 03:31:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2319 transitions. [2019-10-15 03:31:33,553 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2319 transitions. Word has length 80 [2019-10-15 03:31:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:33,554 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2319 transitions. [2019-10-15 03:31:33,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:31:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2319 transitions. [2019-10-15 03:31:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 03:31:33,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:33,558 INFO L380 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] [2019-10-15 03:31:33,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:33,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash -852047705, now seen corresponding path program 1 times [2019-10-15 03:31:33,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:33,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55308778] [2019-10-15 03:31:33,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:33,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55308778] [2019-10-15 03:31:33,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:33,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:31:33,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126167702] [2019-10-15 03:31:33,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:31:33,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:31:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:33,817 INFO L87 Difference]: Start difference. First operand 1649 states and 2319 transitions. Second operand 9 states. [2019-10-15 03:31:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:35,524 INFO L93 Difference]: Finished difference Result 1945 states and 2959 transitions. [2019-10-15 03:31:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:31:35,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-15 03:31:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:35,543 INFO L225 Difference]: With dead ends: 1945 [2019-10-15 03:31:35,543 INFO L226 Difference]: Without dead ends: 1942 [2019-10-15 03:31:35,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:31:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-10-15 03:31:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1753. [2019-10-15 03:31:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-10-15 03:31:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2548 transitions. [2019-10-15 03:31:35,689 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2548 transitions. Word has length 85 [2019-10-15 03:31:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:35,689 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 2548 transitions. [2019-10-15 03:31:35,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:31:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2548 transitions. [2019-10-15 03:31:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 03:31:35,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:35,705 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:35,705 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2099101405, now seen corresponding path program 1 times [2019-10-15 03:31:35,706 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:35,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633851960] [2019-10-15 03:31:35,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:35,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:35,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:35,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633851960] [2019-10-15 03:31:35,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110409224] [2019-10-15 03:31:35,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:35,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:35,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:36,008 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:36,099 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:36,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-15 03:31:36,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915431775] [2019-10-15 03:31:36,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:36,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:36,101 INFO L87 Difference]: Start difference. First operand 1753 states and 2548 transitions. Second operand 4 states. [2019-10-15 03:31:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:36,339 INFO L93 Difference]: Finished difference Result 4472 states and 6595 transitions. [2019-10-15 03:31:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:36,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 03:31:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:36,406 INFO L225 Difference]: With dead ends: 4472 [2019-10-15 03:31:36,406 INFO L226 Difference]: Without dead ends: 2736 [2019-10-15 03:31:36,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-10-15 03:31:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2249. [2019-10-15 03:31:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-10-15 03:31:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3231 transitions. [2019-10-15 03:31:36,604 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3231 transitions. Word has length 85 [2019-10-15 03:31:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:36,605 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 3231 transitions. [2019-10-15 03:31:36,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3231 transitions. [2019-10-15 03:31:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:31:36,609 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:36,609 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:36,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:36,814 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1219328812, now seen corresponding path program 1 times [2019-10-15 03:31:36,815 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:36,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303616272] [2019-10-15 03:31:36,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:36,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:36,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:31:36,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303616272] [2019-10-15 03:31:36,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:36,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:31:36,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516864343] [2019-10-15 03:31:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:31:36,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:31:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:36,946 INFO L87 Difference]: Start difference. First operand 2249 states and 3231 transitions. Second operand 7 states. [2019-10-15 03:31:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:37,688 INFO L93 Difference]: Finished difference Result 5841 states and 8726 transitions. [2019-10-15 03:31:37,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:31:37,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 03:31:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:37,720 INFO L225 Difference]: With dead ends: 5841 [2019-10-15 03:31:37,721 INFO L226 Difference]: Without dead ends: 3695 [2019-10-15 03:31:37,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:31:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2019-10-15 03:31:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3614. [2019-10-15 03:31:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2019-10-15 03:31:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5213 transitions. [2019-10-15 03:31:38,022 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5213 transitions. Word has length 96 [2019-10-15 03:31:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:38,023 INFO L462 AbstractCegarLoop]: Abstraction has 3614 states and 5213 transitions. [2019-10-15 03:31:38,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:31:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5213 transitions. [2019-10-15 03:31:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 03:31:38,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:38,027 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-15 03:31:38,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:38,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1715576570, now seen corresponding path program 1 times [2019-10-15 03:31:38,028 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:38,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467657065] [2019-10-15 03:31:38,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:38,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:31:38,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467657065] [2019-10-15 03:31:38,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:38,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:31:38,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460213178] [2019-10-15 03:31:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:31:38,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:31:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:31:38,161 INFO L87 Difference]: Start difference. First operand 3614 states and 5213 transitions. Second operand 8 states. [2019-10-15 03:31:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:38,858 INFO L93 Difference]: Finished difference Result 8140 states and 12009 transitions. [2019-10-15 03:31:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:31:38,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-10-15 03:31:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:38,892 INFO L225 Difference]: With dead ends: 8140 [2019-10-15 03:31:38,892 INFO L226 Difference]: Without dead ends: 3993 [2019-10-15 03:31:38,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:31:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2019-10-15 03:31:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 3877. [2019-10-15 03:31:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2019-10-15 03:31:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5668 transitions. [2019-10-15 03:31:39,167 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5668 transitions. Word has length 100 [2019-10-15 03:31:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:39,168 INFO L462 AbstractCegarLoop]: Abstraction has 3877 states and 5668 transitions. [2019-10-15 03:31:39,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:31:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5668 transitions. [2019-10-15 03:31:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:31:39,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:39,171 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:39,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:39,172 INFO L82 PathProgramCache]: Analyzing trace with hash -518224059, now seen corresponding path program 1 times [2019-10-15 03:31:39,172 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:39,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74656349] [2019-10-15 03:31:39,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:39,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:39,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:39,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74656349] [2019-10-15 03:31:39,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328660131] [2019-10-15 03:31:39,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:39,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 03:31:39,477 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 03:31:39,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:39,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-15 03:31:39,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743982852] [2019-10-15 03:31:39,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:39,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:31:39,568 INFO L87 Difference]: Start difference. First operand 3877 states and 5668 transitions. Second operand 3 states. [2019-10-15 03:31:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:39,930 INFO L93 Difference]: Finished difference Result 9626 states and 14451 transitions. [2019-10-15 03:31:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:39,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-15 03:31:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:39,977 INFO L225 Difference]: With dead ends: 9626 [2019-10-15 03:31:39,977 INFO L226 Difference]: Without dead ends: 5766 [2019-10-15 03:31:40,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:31:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-10-15 03:31:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5210. [2019-10-15 03:31:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5210 states. [2019-10-15 03:31:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7507 transitions. [2019-10-15 03:31:40,393 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7507 transitions. Word has length 102 [2019-10-15 03:31:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:40,393 INFO L462 AbstractCegarLoop]: Abstraction has 5210 states and 7507 transitions. [2019-10-15 03:31:40,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7507 transitions. [2019-10-15 03:31:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:31:40,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:40,398 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 03:31:40,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:40,604 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:40,604 INFO L82 PathProgramCache]: Analyzing trace with hash 468891600, now seen corresponding path program 1 times [2019-10-15 03:31:40,605 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:40,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233056619] [2019-10-15 03:31:40,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:40,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:40,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:31:40,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233056619] [2019-10-15 03:31:40,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096906934] [2019-10-15 03:31:40,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:40,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:40,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:31:40,888 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:31:41,049 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:41,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-15 03:31:41,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779253741] [2019-10-15 03:31:41,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:41,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:31:41,051 INFO L87 Difference]: Start difference. First operand 5210 states and 7507 transitions. Second operand 4 states. [2019-10-15 03:31:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:41,490 INFO L93 Difference]: Finished difference Result 13475 states and 19117 transitions. [2019-10-15 03:31:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:41,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-15 03:31:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:41,563 INFO L225 Difference]: With dead ends: 13475 [2019-10-15 03:31:41,564 INFO L226 Difference]: Without dead ends: 8282 [2019-10-15 03:31:41,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:31:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-10-15 03:31:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 7341. [2019-10-15 03:31:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7341 states. [2019-10-15 03:31:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10069 transitions. [2019-10-15 03:31:42,177 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10069 transitions. Word has length 104 [2019-10-15 03:31:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:42,180 INFO L462 AbstractCegarLoop]: Abstraction has 7341 states and 10069 transitions. [2019-10-15 03:31:42,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10069 transitions. [2019-10-15 03:31:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 03:31:42,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:42,184 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:42,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:42,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1692868379, now seen corresponding path program 1 times [2019-10-15 03:31:42,390 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:42,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000707041] [2019-10-15 03:31:42,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:42,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:42,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:42,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000707041] [2019-10-15 03:31:42,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:42,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:42,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499254070] [2019-10-15 03:31:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:42,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:42,441 INFO L87 Difference]: Start difference. First operand 7341 states and 10069 transitions. Second operand 3 states. [2019-10-15 03:31:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:42,914 INFO L93 Difference]: Finished difference Result 17526 states and 24227 transitions. [2019-10-15 03:31:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:42,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 03:31:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:42,965 INFO L225 Difference]: With dead ends: 17526 [2019-10-15 03:31:42,965 INFO L226 Difference]: Without dead ends: 10202 [2019-10-15 03:31:42,989 INFO L600 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-10-15 03:31:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2019-10-15 03:31:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 8362. [2019-10-15 03:31:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-10-15 03:31:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 11397 transitions. [2019-10-15 03:31:43,994 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 11397 transitions. Word has length 105 [2019-10-15 03:31:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:43,995 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 11397 transitions. [2019-10-15 03:31:43,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 11397 transitions. [2019-10-15 03:31:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:31:43,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:43,999 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:43,999 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash 40776413, now seen corresponding path program 1 times [2019-10-15 03:31:44,000 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:44,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042063594] [2019-10-15 03:31:44,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:44,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:44,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:44,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042063594] [2019-10-15 03:31:44,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:44,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:31:44,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137517792] [2019-10-15 03:31:44,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:31:44,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:31:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:31:44,164 INFO L87 Difference]: Start difference. First operand 8362 states and 11397 transitions. Second operand 12 states. [2019-10-15 03:31:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:46,209 INFO L93 Difference]: Finished difference Result 17361 states and 24030 transitions. [2019-10-15 03:31:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 03:31:46,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2019-10-15 03:31:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:46,258 INFO L225 Difference]: With dead ends: 17361 [2019-10-15 03:31:46,258 INFO L226 Difference]: Without dead ends: 9228 [2019-10-15 03:31:46,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-10-15 03:31:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2019-10-15 03:31:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8645. [2019-10-15 03:31:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-10-15 03:31:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 11903 transitions. [2019-10-15 03:31:46,687 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 11903 transitions. Word has length 106 [2019-10-15 03:31:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:46,687 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 11903 transitions. [2019-10-15 03:31:46,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:31:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 11903 transitions. [2019-10-15 03:31:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 03:31:46,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:46,693 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:46,693 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash -389092132, now seen corresponding path program 1 times [2019-10-15 03:31:46,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:46,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686094470] [2019-10-15 03:31:46,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:46,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:46,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 03:31:46,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686094470] [2019-10-15 03:31:46,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:46,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:46,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413741930] [2019-10-15 03:31:46,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:46,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:46,771 INFO L87 Difference]: Start difference. First operand 8645 states and 11903 transitions. Second operand 4 states. [2019-10-15 03:31:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:47,423 INFO L93 Difference]: Finished difference Result 17454 states and 24668 transitions. [2019-10-15 03:31:47,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:47,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-15 03:31:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:47,453 INFO L225 Difference]: With dead ends: 17454 [2019-10-15 03:31:47,454 INFO L226 Difference]: Without dead ends: 6518 [2019-10-15 03:31:47,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6518 states. [2019-10-15 03:31:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6518 to 6308. [2019-10-15 03:31:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6308 states. [2019-10-15 03:31:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8161 transitions. [2019-10-15 03:31:47,804 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8161 transitions. Word has length 149 [2019-10-15 03:31:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:47,805 INFO L462 AbstractCegarLoop]: Abstraction has 6308 states and 8161 transitions. [2019-10-15 03:31:47,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8161 transitions. [2019-10-15 03:31:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 03:31:47,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:47,812 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:47,812 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1337317932, now seen corresponding path program 1 times [2019-10-15 03:31:47,813 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:47,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440674761] [2019-10-15 03:31:47,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:47,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:47,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:47,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440674761] [2019-10-15 03:31:47,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:47,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:47,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571627259] [2019-10-15 03:31:47,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:47,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:47,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:47,881 INFO L87 Difference]: Start difference. First operand 6308 states and 8161 transitions. Second operand 4 states. [2019-10-15 03:31:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:48,556 INFO L93 Difference]: Finished difference Result 15508 states and 20833 transitions. [2019-10-15 03:31:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:48,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-15 03:31:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:48,594 INFO L225 Difference]: With dead ends: 15508 [2019-10-15 03:31:48,595 INFO L226 Difference]: Without dead ends: 9216 [2019-10-15 03:31:48,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-10-15 03:31:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8786. [2019-10-15 03:31:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8786 states. [2019-10-15 03:31:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8786 states to 8786 states and 11423 transitions. [2019-10-15 03:31:49,065 INFO L78 Accepts]: Start accepts. Automaton has 8786 states and 11423 transitions. Word has length 132 [2019-10-15 03:31:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:49,066 INFO L462 AbstractCegarLoop]: Abstraction has 8786 states and 11423 transitions. [2019-10-15 03:31:49,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8786 states and 11423 transitions. [2019-10-15 03:31:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 03:31:49,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:49,070 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:49,071 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -463840237, now seen corresponding path program 1 times [2019-10-15 03:31:49,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:49,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506496533] [2019-10-15 03:31:49,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:49,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:49,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:31:49,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506496533] [2019-10-15 03:31:49,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:49,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:49,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579106706] [2019-10-15 03:31:49,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:49,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:49,164 INFO L87 Difference]: Start difference. First operand 8786 states and 11423 transitions. Second operand 4 states. [2019-10-15 03:31:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:49,861 INFO L93 Difference]: Finished difference Result 16060 states and 21147 transitions. [2019-10-15 03:31:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:49,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-15 03:31:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:49,908 INFO L225 Difference]: With dead ends: 16060 [2019-10-15 03:31:49,909 INFO L226 Difference]: Without dead ends: 9862 [2019-10-15 03:31:50,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9862 states. [2019-10-15 03:31:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9862 to 9862. [2019-10-15 03:31:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9862 states. [2019-10-15 03:31:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 12524 transitions. [2019-10-15 03:31:50,530 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 12524 transitions. Word has length 132 [2019-10-15 03:31:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:50,530 INFO L462 AbstractCegarLoop]: Abstraction has 9862 states and 12524 transitions. [2019-10-15 03:31:50,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 12524 transitions. [2019-10-15 03:31:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:31:50,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:50,534 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:50,534 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1318512795, now seen corresponding path program 1 times [2019-10-15 03:31:50,535 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:50,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359135207] [2019-10-15 03:31:50,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:50,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:50,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:31:50,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359135207] [2019-10-15 03:31:50,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837968940] [2019-10-15 03:31:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:50,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 03:31:50,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:50,912 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 03:31:51,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:51,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 5] total 18 [2019-10-15 03:31:51,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852227467] [2019-10-15 03:31:51,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:51,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:31:51,058 INFO L87 Difference]: Start difference. First operand 9862 states and 12524 transitions. Second operand 5 states. [2019-10-15 03:31:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:51,920 INFO L93 Difference]: Finished difference Result 21033 states and 27289 transitions. [2019-10-15 03:31:51,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:31:51,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 03:31:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:51,985 INFO L225 Difference]: With dead ends: 21033 [2019-10-15 03:31:51,985 INFO L226 Difference]: Without dead ends: 14540 [2019-10-15 03:31:52,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:31:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14540 states. [2019-10-15 03:31:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14540 to 13920. [2019-10-15 03:31:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13920 states. [2019-10-15 03:31:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13920 states to 13920 states and 17703 transitions. [2019-10-15 03:31:52,609 INFO L78 Accepts]: Start accepts. Automaton has 13920 states and 17703 transitions. Word has length 133 [2019-10-15 03:31:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:52,610 INFO L462 AbstractCegarLoop]: Abstraction has 13920 states and 17703 transitions. [2019-10-15 03:31:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13920 states and 17703 transitions. [2019-10-15 03:31:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 03:31:52,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:52,616 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:52,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:52,818 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2032127136, now seen corresponding path program 1 times [2019-10-15 03:31:52,819 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:52,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970507396] [2019-10-15 03:31:52,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:52,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:52,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 03:31:52,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970507396] [2019-10-15 03:31:52,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:52,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:31:52,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073501547] [2019-10-15 03:31:52,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:52,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:31:52,916 INFO L87 Difference]: Start difference. First operand 13920 states and 17703 transitions. Second operand 5 states. [2019-10-15 03:31:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:53,870 INFO L93 Difference]: Finished difference Result 27004 states and 35626 transitions. [2019-10-15 03:31:53,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:31:53,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-15 03:31:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:53,941 INFO L225 Difference]: With dead ends: 27004 [2019-10-15 03:31:53,942 INFO L226 Difference]: Without dead ends: 14926 [2019-10-15 03:31:53,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14926 states. [2019-10-15 03:31:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14926 to 14192. [2019-10-15 03:31:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14192 states. [2019-10-15 03:31:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 17960 transitions. [2019-10-15 03:31:55,021 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 17960 transitions. Word has length 145 [2019-10-15 03:31:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:55,022 INFO L462 AbstractCegarLoop]: Abstraction has 14192 states and 17960 transitions. [2019-10-15 03:31:55,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 17960 transitions. [2019-10-15 03:31:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 03:31:55,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:55,028 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 03:31:55,028 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1762326492, now seen corresponding path program 1 times [2019-10-15 03:31:55,029 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:55,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442024838] [2019-10-15 03:31:55,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:55,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:55,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 03:31:55,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442024838] [2019-10-15 03:31:55,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363124704] [2019-10-15 03:31:55,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:55,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 03:31:55,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:31:55,473 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:55,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 03:31:55,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:55,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-10-15 03:31:55,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715159395] [2019-10-15 03:31:55,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:31:55,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:55,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:31:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-15 03:31:55,812 INFO L87 Difference]: Start difference. First operand 14192 states and 17960 transitions. Second operand 11 states.