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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:09,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:09,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:09,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:09,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:09,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:09,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:09,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:09,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:09,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:09,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:09,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:09,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:09,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:09,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:09,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:09,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:09,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:09,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:09,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:09,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:09,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:09,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:09,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:09,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:09,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:09,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:09,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:09,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:09,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:09,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:09,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:09,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:09,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:09,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:09,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:09,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:09,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:09,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:09,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:09,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:09,669 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:27:09,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:09,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:09,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:09,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:09,699 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:09,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:09,700 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:09,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:09,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:09,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:09,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:09,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:09,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:09,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:09,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:09,701 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:09,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:09,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:09,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:09,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:09,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:09,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:09,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:09,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:09,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:09,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:09,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:09,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:09,704 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:27:09,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:10,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:10,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:10,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:10,023 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:10,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:10,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791161dd1/05c4f550d548417da401161f62df2bb3/FLAG5ca6a8441 [2019-10-15 03:27:10,597 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:10,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:10,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791161dd1/05c4f550d548417da401161f62df2bb3/FLAG5ca6a8441 [2019-10-15 03:27:10,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791161dd1/05c4f550d548417da401161f62df2bb3 [2019-10-15 03:27:10,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:10,945 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:10,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:10,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:10,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:10,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:10" (1/1) ... [2019-10-15 03:27:10,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6885b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:10, skipping insertion in model container [2019-10-15 03:27:10,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:10" (1/1) ... [2019-10-15 03:27:10,962 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:11,008 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:11,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:11,520 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:11,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:11,608 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:11,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11 WrapperNode [2019-10-15 03:27:11,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:11,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:11,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:11,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:11,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:11,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:11,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:11,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:11,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (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:27:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 03:27:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 03:27:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 03:27:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:11,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 03:27:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 03:27:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:11,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:13,215 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:13,215 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:27:13,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:13 BoogieIcfgContainer [2019-10-15 03:27:13,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:13,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:13,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:13,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:13,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:10" (1/3) ... [2019-10-15 03:27:13,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a615cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:13, skipping insertion in model container [2019-10-15 03:27:13,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11" (2/3) ... [2019-10-15 03:27:13,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a615cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:13, skipping insertion in model container [2019-10-15 03:27:13,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:13" (3/3) ... [2019-10-15 03:27:13,226 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:13,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:13,247 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:13,260 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:13,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:13,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:13,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:13,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:13,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:13,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:13,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:13,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-10-15 03:27:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:27:13,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,325 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] [2019-10-15 03:27:13,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,334 INFO L82 PathProgramCache]: Analyzing trace with hash -696783202, now seen corresponding path program 1 times [2019-10-15 03:27:13,344 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65898799] [2019-10-15 03:27:13,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:13,932 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:27:13,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65898799] [2019-10-15 03:27:13,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:13,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:13,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007796092] [2019-10-15 03:27:13,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:13,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:13,960 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2019-10-15 03:27:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,166 INFO L93 Difference]: Finished difference Result 350 states and 532 transitions. [2019-10-15 03:27:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-15 03:27:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,187 INFO L225 Difference]: With dead ends: 350 [2019-10-15 03:27:14,187 INFO L226 Difference]: Without dead ends: 180 [2019-10-15 03:27:14,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-15 03:27:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-10-15 03:27:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-15 03:27:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2019-10-15 03:27:14,308 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 44 [2019-10-15 03:27:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,308 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2019-10-15 03:27:14,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2019-10-15 03:27:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:14,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,312 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] [2019-10-15 03:27:14,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash 942948947, now seen corresponding path program 1 times [2019-10-15 03:27:14,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338867928] [2019-10-15 03:27:14,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,548 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:27:14,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338867928] [2019-10-15 03:27:14,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:14,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832425639] [2019-10-15 03:27:14,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:14,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:14,556 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 5 states. [2019-10-15 03:27:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,718 INFO L93 Difference]: Finished difference Result 689 states and 976 transitions. [2019-10-15 03:27:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:14,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-15 03:27:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,753 INFO L225 Difference]: With dead ends: 689 [2019-10-15 03:27:14,753 INFO L226 Difference]: Without dead ends: 500 [2019-10-15 03:27:14,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-15 03:27:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2019-10-15 03:27:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-15 03:27:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 504 transitions. [2019-10-15 03:27:14,815 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 504 transitions. Word has length 58 [2019-10-15 03:27:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,816 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 504 transitions. [2019-10-15 03:27:14,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2019-10-15 03:27:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:27:14,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,819 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] [2019-10-15 03:27:14,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1685484368, now seen corresponding path program 1 times [2019-10-15 03:27:14,820 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055890605] [2019-10-15 03:27:14,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,939 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:27:14,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055890605] [2019-10-15 03:27:14,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251680454] [2019-10-15 03:27:14,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,943 INFO L87 Difference]: Start difference. First operand 357 states and 504 transitions. Second operand 4 states. [2019-10-15 03:27:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,017 INFO L93 Difference]: Finished difference Result 715 states and 1015 transitions. [2019-10-15 03:27:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:15,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-15 03:27:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,024 INFO L225 Difference]: With dead ends: 715 [2019-10-15 03:27:15,024 INFO L226 Difference]: Without dead ends: 367 [2019-10-15 03:27:15,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-15 03:27:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2019-10-15 03:27:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 03:27:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 512 transitions. [2019-10-15 03:27:15,086 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 512 transitions. Word has length 60 [2019-10-15 03:27:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,086 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 512 transitions. [2019-10-15 03:27:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 512 transitions. [2019-10-15 03:27:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 03:27:15,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,090 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] [2019-10-15 03:27:15,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 952873872, now seen corresponding path program 1 times [2019-10-15 03:27:15,091 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284737761] [2019-10-15 03:27:15,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,197 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:27:15,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284737761] [2019-10-15 03:27:15,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:15,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15399126] [2019-10-15 03:27:15,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:15,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:15,200 INFO L87 Difference]: Start difference. First operand 367 states and 512 transitions. Second operand 4 states. [2019-10-15 03:27:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,273 INFO L93 Difference]: Finished difference Result 735 states and 1037 transitions. [2019-10-15 03:27:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:15,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-15 03:27:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,277 INFO L225 Difference]: With dead ends: 735 [2019-10-15 03:27:15,278 INFO L226 Difference]: Without dead ends: 377 [2019-10-15 03:27:15,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-10-15 03:27:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-10-15 03:27:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-15 03:27:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 520 transitions. [2019-10-15 03:27:15,306 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 520 transitions. Word has length 68 [2019-10-15 03:27:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,307 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 520 transitions. [2019-10-15 03:27:15,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 520 transitions. [2019-10-15 03:27:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:15,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,312 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] [2019-10-15 03:27:15,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 81922330, now seen corresponding path program 1 times [2019-10-15 03:27:15,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617309791] [2019-10-15 03:27:15,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:15,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617309791] [2019-10-15 03:27:15,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:15,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193771685] [2019-10-15 03:27:15,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:15,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:15,449 INFO L87 Difference]: Start difference. First operand 377 states and 520 transitions. Second operand 4 states. [2019-10-15 03:27:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,516 INFO L93 Difference]: Finished difference Result 753 states and 1045 transitions. [2019-10-15 03:27:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:15,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:27:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,520 INFO L225 Difference]: With dead ends: 753 [2019-10-15 03:27:15,520 INFO L226 Difference]: Without dead ends: 385 [2019-10-15 03:27:15,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-15 03:27:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-10-15 03:27:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-10-15 03:27:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 526 transitions. [2019-10-15 03:27:15,546 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 526 transitions. Word has length 76 [2019-10-15 03:27:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,546 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 526 transitions. [2019-10-15 03:27:15,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 526 transitions. [2019-10-15 03:27:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:15,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,572 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] [2019-10-15 03:27:15,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 205873206, now seen corresponding path program 1 times [2019-10-15 03:27:15,573 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418422714] [2019-10-15 03:27:15,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,666 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:27:15,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418422714] [2019-10-15 03:27:15,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:15,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758277506] [2019-10-15 03:27:15,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:15,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:15,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:15,669 INFO L87 Difference]: Start difference. First operand 385 states and 526 transitions. Second operand 4 states. [2019-10-15 03:27:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,735 INFO L93 Difference]: Finished difference Result 771 states and 1065 transitions. [2019-10-15 03:27:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:15,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:27:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,739 INFO L225 Difference]: With dead ends: 771 [2019-10-15 03:27:15,740 INFO L226 Difference]: Without dead ends: 395 [2019-10-15 03:27:15,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-15 03:27:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-15 03:27:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-15 03:27:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 534 transitions. [2019-10-15 03:27:15,771 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 534 transitions. Word has length 76 [2019-10-15 03:27:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,772 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 534 transitions. [2019-10-15 03:27:15,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 534 transitions. [2019-10-15 03:27:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:27:15,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,774 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:27:15,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1572038470, now seen corresponding path program 1 times [2019-10-15 03:27:15,775 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744587653] [2019-10-15 03:27:15,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:27:15,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744587653] [2019-10-15 03:27:15,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:15,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872228093] [2019-10-15 03:27:15,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:15,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:15,879 INFO L87 Difference]: Start difference. First operand 395 states and 534 transitions. Second operand 4 states. [2019-10-15 03:27:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,934 INFO L93 Difference]: Finished difference Result 793 states and 1079 transitions. [2019-10-15 03:27:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:15,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-15 03:27:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,938 INFO L225 Difference]: With dead ends: 793 [2019-10-15 03:27:15,939 INFO L226 Difference]: Without dead ends: 407 [2019-10-15 03:27:15,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-15 03:27:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-15 03:27:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-15 03:27:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2019-10-15 03:27:15,962 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 84 [2019-10-15 03:27:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2019-10-15 03:27:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2019-10-15 03:27:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 03:27:15,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,965 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:15,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1474569183, now seen corresponding path program 1 times [2019-10-15 03:27:15,966 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541530309] [2019-10-15 03:27:15,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:27:16,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541530309] [2019-10-15 03:27:16,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:16,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:16,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526871298] [2019-10-15 03:27:16,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:16,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:16,303 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand 12 states. [2019-10-15 03:27:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,113 INFO L93 Difference]: Finished difference Result 1284 states and 1689 transitions. [2019-10-15 03:27:19,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:19,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-15 03:27:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,121 INFO L225 Difference]: With dead ends: 1284 [2019-10-15 03:27:19,121 INFO L226 Difference]: Without dead ends: 886 [2019-10-15 03:27:19,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-15 03:27:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-15 03:27:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 826. [2019-10-15 03:27:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-15 03:27:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1080 transitions. [2019-10-15 03:27:19,170 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1080 transitions. Word has length 89 [2019-10-15 03:27:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,171 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1080 transitions. [2019-10-15 03:27:19,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1080 transitions. [2019-10-15 03:27:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:27:19,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,173 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:27:19,173 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1411945989, now seen corresponding path program 1 times [2019-10-15 03:27:19,174 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401357663] [2019-10-15 03:27:19,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:27:19,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401357663] [2019-10-15 03:27:19,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:19,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:19,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639974492] [2019-10-15 03:27:19,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:19,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:19,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:19,263 INFO L87 Difference]: Start difference. First operand 826 states and 1080 transitions. Second operand 4 states. [2019-10-15 03:27:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,327 INFO L93 Difference]: Finished difference Result 1524 states and 1999 transitions. [2019-10-15 03:27:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:19,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 03:27:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,334 INFO L225 Difference]: With dead ends: 1524 [2019-10-15 03:27:19,334 INFO L226 Difference]: Without dead ends: 834 [2019-10-15 03:27:19,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-10-15 03:27:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2019-10-15 03:27:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-10-15 03:27:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1076 transitions. [2019-10-15 03:27:19,380 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1076 transitions. Word has length 91 [2019-10-15 03:27:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,380 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1076 transitions. [2019-10-15 03:27:19,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1076 transitions. [2019-10-15 03:27:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 03:27:19,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,383 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] [2019-10-15 03:27:19,383 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -829194726, now seen corresponding path program 1 times [2019-10-15 03:27:19,384 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413735297] [2019-10-15 03:27:19,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:19,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413735297] [2019-10-15 03:27:19,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:19,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:19,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439073460] [2019-10-15 03:27:19,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:19,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:19,492 INFO L87 Difference]: Start difference. First operand 834 states and 1076 transitions. Second operand 4 states. [2019-10-15 03:27:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,554 INFO L93 Difference]: Finished difference Result 1490 states and 1925 transitions. [2019-10-15 03:27:19,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:19,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-15 03:27:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,560 INFO L225 Difference]: With dead ends: 1490 [2019-10-15 03:27:19,561 INFO L226 Difference]: Without dead ends: 826 [2019-10-15 03:27:19,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-10-15 03:27:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2019-10-15 03:27:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-15 03:27:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1052 transitions. [2019-10-15 03:27:19,622 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1052 transitions. Word has length 93 [2019-10-15 03:27:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,623 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1052 transitions. [2019-10-15 03:27:19,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1052 transitions. [2019-10-15 03:27:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:27:19,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,625 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:27:19,625 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash 220728736, now seen corresponding path program 1 times [2019-10-15 03:27:19,626 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785437913] [2019-10-15 03:27:19,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:19,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785437913] [2019-10-15 03:27:19,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:19,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:19,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57626939] [2019-10-15 03:27:19,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:19,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:19,840 INFO L87 Difference]: Start difference. First operand 826 states and 1052 transitions. Second operand 9 states. [2019-10-15 03:27:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,946 INFO L93 Difference]: Finished difference Result 884 states and 1136 transitions. [2019-10-15 03:27:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:27:19,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-15 03:27:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,955 INFO L225 Difference]: With dead ends: 884 [2019-10-15 03:27:19,955 INFO L226 Difference]: Without dead ends: 882 [2019-10-15 03:27:19,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:27:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-15 03:27:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 846. [2019-10-15 03:27:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-15 03:27:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1074 transitions. [2019-10-15 03:27:20,007 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1074 transitions. Word has length 92 [2019-10-15 03:27:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:20,009 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1074 transitions. [2019-10-15 03:27:20,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1074 transitions. [2019-10-15 03:27:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 03:27:20,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:20,013 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] [2019-10-15 03:27:20,014 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1901963715, now seen corresponding path program 1 times [2019-10-15 03:27:20,015 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:20,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353834504] [2019-10-15 03:27:20,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:20,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353834504] [2019-10-15 03:27:20,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:20,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326361287] [2019-10-15 03:27:20,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:20,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:20,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:20,302 INFO L87 Difference]: Start difference. First operand 846 states and 1074 transitions. Second operand 12 states. [2019-10-15 03:27:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,060 INFO L93 Difference]: Finished difference Result 2436 states and 3052 transitions. [2019-10-15 03:27:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:24,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-15 03:27:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,070 INFO L225 Difference]: With dead ends: 2436 [2019-10-15 03:27:24,070 INFO L226 Difference]: Without dead ends: 1760 [2019-10-15 03:27:24,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-15 03:27:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-10-15 03:27:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1371. [2019-10-15 03:27:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-10-15 03:27:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1728 transitions. [2019-10-15 03:27:24,177 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1728 transitions. Word has length 97 [2019-10-15 03:27:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,178 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 1728 transitions. [2019-10-15 03:27:24,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1728 transitions. [2019-10-15 03:27:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 03:27:24,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,181 INFO L380 BasicCegarLoop]: trace histogram [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:27:24,181 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1643610553, now seen corresponding path program 1 times [2019-10-15 03:27:24,182 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349269767] [2019-10-15 03:27:24,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:24,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349269767] [2019-10-15 03:27:24,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:24,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032524649] [2019-10-15 03:27:24,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:24,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:24,273 INFO L87 Difference]: Start difference. First operand 1371 states and 1728 transitions. Second operand 5 states. [2019-10-15 03:27:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,683 INFO L93 Difference]: Finished difference Result 4899 states and 6249 transitions. [2019-10-15 03:27:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:24,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 03:27:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,765 INFO L225 Difference]: With dead ends: 4899 [2019-10-15 03:27:24,766 INFO L226 Difference]: Without dead ends: 3688 [2019-10-15 03:27:24,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:27:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2019-10-15 03:27:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3432. [2019-10-15 03:27:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-10-15 03:27:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4344 transitions. [2019-10-15 03:27:24,970 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4344 transitions. Word has length 98 [2019-10-15 03:27:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,970 INFO L462 AbstractCegarLoop]: Abstraction has 3432 states and 4344 transitions. [2019-10-15 03:27:24,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4344 transitions. [2019-10-15 03:27:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 03:27:24,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,975 INFO L380 BasicCegarLoop]: trace histogram [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:27:24,975 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2019998169, now seen corresponding path program 1 times [2019-10-15 03:27:24,976 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3170844] [2019-10-15 03:27:24,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:27:25,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3170844] [2019-10-15 03:27:25,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:25,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099606194] [2019-10-15 03:27:25,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:25,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:25,198 INFO L87 Difference]: Start difference. First operand 3432 states and 4344 transitions. Second operand 9 states. [2019-10-15 03:27:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:26,961 INFO L93 Difference]: Finished difference Result 7463 states and 9481 transitions. [2019-10-15 03:27:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:26,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-15 03:27:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:26,997 INFO L225 Difference]: With dead ends: 7463 [2019-10-15 03:27:26,997 INFO L226 Difference]: Without dead ends: 4395 [2019-10-15 03:27:27,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2019-10-15 03:27:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 3982. [2019-10-15 03:27:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-10-15 03:27:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5029 transitions. [2019-10-15 03:27:27,348 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5029 transitions. Word has length 98 [2019-10-15 03:27:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 3982 states and 5029 transitions. [2019-10-15 03:27:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5029 transitions. [2019-10-15 03:27:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 03:27:27,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:27,355 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:27,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1064329041, now seen corresponding path program 1 times [2019-10-15 03:27:27,356 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:27,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036332366] [2019-10-15 03:27:27,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:27:27,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036332366] [2019-10-15 03:27:27,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:27,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:27,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34332639] [2019-10-15 03:27:27,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:27,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:27,653 INFO L87 Difference]: Start difference. First operand 3982 states and 5029 transitions. Second operand 9 states. [2019-10-15 03:27:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:29,329 INFO L93 Difference]: Finished difference Result 7870 states and 10126 transitions. [2019-10-15 03:27:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:27:29,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-15 03:27:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:29,358 INFO L225 Difference]: With dead ends: 7870 [2019-10-15 03:27:29,358 INFO L226 Difference]: Without dead ends: 4288 [2019-10-15 03:27:29,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:27:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-15 03:27:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3727. [2019-10-15 03:27:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-10-15 03:27:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4726 transitions. [2019-10-15 03:27:29,623 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4726 transitions. Word has length 100 [2019-10-15 03:27:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:29,623 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 4726 transitions. [2019-10-15 03:27:29,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4726 transitions. [2019-10-15 03:27:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:29,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:29,627 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-15 03:27:29,627 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash 966351914, now seen corresponding path program 1 times [2019-10-15 03:27:29,628 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:29,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123241093] [2019-10-15 03:27:29,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 03:27:29,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123241093] [2019-10-15 03:27:29,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:29,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:29,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916138772] [2019-10-15 03:27:29,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:29,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:29,767 INFO L87 Difference]: Start difference. First operand 3727 states and 4726 transitions. Second operand 4 states. [2019-10-15 03:27:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:29,970 INFO L93 Difference]: Finished difference Result 6983 states and 8924 transitions. [2019-10-15 03:27:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:29,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-15 03:27:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:29,998 INFO L225 Difference]: With dead ends: 6983 [2019-10-15 03:27:29,998 INFO L226 Difference]: Without dead ends: 3669 [2019-10-15 03:27:30,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-10-15 03:27:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3669. [2019-10-15 03:27:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3669 states. [2019-10-15 03:27:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4552 transitions. [2019-10-15 03:27:30,297 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4552 transitions. Word has length 102 [2019-10-15 03:27:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:30,298 INFO L462 AbstractCegarLoop]: Abstraction has 3669 states and 4552 transitions. [2019-10-15 03:27:30,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4552 transitions. [2019-10-15 03:27:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:30,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:30,300 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:30,301 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:30,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1813031188, now seen corresponding path program 1 times [2019-10-15 03:27:30,301 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:30,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485781590] [2019-10-15 03:27:30,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:30,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:30,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485781590] [2019-10-15 03:27:30,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:30,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:30,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409236819] [2019-10-15 03:27:30,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:30,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:30,375 INFO L87 Difference]: Start difference. First operand 3669 states and 4552 transitions. Second operand 5 states. [2019-10-15 03:27:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:31,049 INFO L93 Difference]: Finished difference Result 10987 states and 13573 transitions. [2019-10-15 03:27:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:31,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:31,103 INFO L225 Difference]: With dead ends: 10987 [2019-10-15 03:27:31,103 INFO L226 Difference]: Without dead ends: 7823 [2019-10-15 03:27:31,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:27:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2019-10-15 03:27:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 6168. [2019-10-15 03:27:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6168 states. [2019-10-15 03:27:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 7610 transitions. [2019-10-15 03:27:31,568 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 7610 transitions. Word has length 102 [2019-10-15 03:27:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:31,570 INFO L462 AbstractCegarLoop]: Abstraction has 6168 states and 7610 transitions. [2019-10-15 03:27:31,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 7610 transitions. [2019-10-15 03:27:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:31,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:31,575 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:31,576 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1205195067, now seen corresponding path program 1 times [2019-10-15 03:27:31,576 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:31,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571555171] [2019-10-15 03:27:31,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:31,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571555171] [2019-10-15 03:27:31,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:31,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:31,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944930766] [2019-10-15 03:27:31,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:31,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:31,657 INFO L87 Difference]: Start difference. First operand 6168 states and 7610 transitions. Second operand 5 states. [2019-10-15 03:27:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:32,227 INFO L93 Difference]: Finished difference Result 14029 states and 17212 transitions. [2019-10-15 03:27:32,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:32,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:32,270 INFO L225 Difference]: With dead ends: 14029 [2019-10-15 03:27:32,270 INFO L226 Difference]: Without dead ends: 8556 [2019-10-15 03:27:32,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:27:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8556 states. [2019-10-15 03:27:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8556 to 8204. [2019-10-15 03:27:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-10-15 03:27:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 10030 transitions. [2019-10-15 03:27:33,203 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 10030 transitions. Word has length 102 [2019-10-15 03:27:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:33,204 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 10030 transitions. [2019-10-15 03:27:33,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 10030 transitions. [2019-10-15 03:27:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 03:27:33,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:33,209 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:33,209 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1595637516, now seen corresponding path program 1 times [2019-10-15 03:27:33,210 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:33,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705130494] [2019-10-15 03:27:33,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:33,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705130494] [2019-10-15 03:27:33,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:33,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:33,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056085247] [2019-10-15 03:27:33,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:33,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:33,261 INFO L87 Difference]: Start difference. First operand 8204 states and 10030 transitions. Second operand 3 states. [2019-10-15 03:27:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:33,504 INFO L93 Difference]: Finished difference Result 15758 states and 19198 transitions. [2019-10-15 03:27:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:33,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-15 03:27:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:33,539 INFO L225 Difference]: With dead ends: 15758 [2019-10-15 03:27:33,539 INFO L226 Difference]: Without dead ends: 8243 [2019-10-15 03:27:33,561 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:27:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8243 states. [2019-10-15 03:27:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8243 to 8210. [2019-10-15 03:27:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8210 states. [2019-10-15 03:27:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 10036 transitions. [2019-10-15 03:27:34,085 INFO L78 Accepts]: Start accepts. Automaton has 8210 states and 10036 transitions. Word has length 103 [2019-10-15 03:27:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:34,085 INFO L462 AbstractCegarLoop]: Abstraction has 8210 states and 10036 transitions. [2019-10-15 03:27:34,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8210 states and 10036 transitions. [2019-10-15 03:27:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:27:34,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:34,093 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:34,093 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash -573406473, now seen corresponding path program 1 times [2019-10-15 03:27:34,094 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:34,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602780139] [2019-10-15 03:27:34,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:34,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602780139] [2019-10-15 03:27:34,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:34,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:34,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260954626] [2019-10-15 03:27:34,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:34,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:34,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:34,296 INFO L87 Difference]: Start difference. First operand 8210 states and 10036 transitions. Second operand 9 states. [2019-10-15 03:27:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:35,538 INFO L93 Difference]: Finished difference Result 15702 states and 19092 transitions. [2019-10-15 03:27:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:27:35,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-15 03:27:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:35,572 INFO L225 Difference]: With dead ends: 15702 [2019-10-15 03:27:35,572 INFO L226 Difference]: Without dead ends: 7672 [2019-10-15 03:27:35,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:27:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-10-15 03:27:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 6925. [2019-10-15 03:27:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6925 states. [2019-10-15 03:27:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8381 transitions. [2019-10-15 03:27:36,125 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8381 transitions. Word has length 104 [2019-10-15 03:27:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:36,125 INFO L462 AbstractCegarLoop]: Abstraction has 6925 states and 8381 transitions. [2019-10-15 03:27:36,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8381 transitions. [2019-10-15 03:27:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 03:27:36,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:36,129 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:36,130 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:36,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash 789902915, now seen corresponding path program 1 times [2019-10-15 03:27:36,131 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:36,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926028727] [2019-10-15 03:27:36,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:36,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926028727] [2019-10-15 03:27:36,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:36,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:27:36,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671072719] [2019-10-15 03:27:36,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:27:36,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:27:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:27:36,347 INFO L87 Difference]: Start difference. First operand 6925 states and 8381 transitions. Second operand 8 states. [2019-10-15 03:27:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:37,736 INFO L93 Difference]: Finished difference Result 13563 states and 16384 transitions. [2019-10-15 03:27:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:37,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-15 03:27:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:37,763 INFO L225 Difference]: With dead ends: 13563 [2019-10-15 03:27:37,763 INFO L226 Difference]: Without dead ends: 6765 [2019-10-15 03:27:37,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:27:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2019-10-15 03:27:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6262. [2019-10-15 03:27:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-10-15 03:27:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 7546 transitions. [2019-10-15 03:27:38,272 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 7546 transitions. Word has length 105 [2019-10-15 03:27:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:38,273 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 7546 transitions. [2019-10-15 03:27:38,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:27:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 7546 transitions. [2019-10-15 03:27:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 03:27:38,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:38,276 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:38,276 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 196478960, now seen corresponding path program 1 times [2019-10-15 03:27:38,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:38,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096590321] [2019-10-15 03:27:38,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 03:27:38,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096590321] [2019-10-15 03:27:38,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:38,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:38,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891613968] [2019-10-15 03:27:38,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:38,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:38,387 INFO L87 Difference]: Start difference. First operand 6262 states and 7546 transitions. Second operand 4 states. [2019-10-15 03:27:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:38,737 INFO L93 Difference]: Finished difference Result 12140 states and 14755 transitions. [2019-10-15 03:27:38,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:38,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-15 03:27:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:38,768 INFO L225 Difference]: With dead ends: 12140 [2019-10-15 03:27:38,769 INFO L226 Difference]: Without dead ends: 6142 [2019-10-15 03:27:38,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-10-15 03:27:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5764. [2019-10-15 03:27:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-10-15 03:27:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6706 transitions. [2019-10-15 03:27:39,276 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6706 transitions. Word has length 118 [2019-10-15 03:27:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:39,277 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6706 transitions. [2019-10-15 03:27:39,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6706 transitions. [2019-10-15 03:27:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 03:27:39,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:39,283 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:39,284 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash -544879366, now seen corresponding path program 1 times [2019-10-15 03:27:39,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:39,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922974553] [2019-10-15 03:27:39,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:39,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:39,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-15 03:27:39,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922974553] [2019-10-15 03:27:39,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:39,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:39,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557659574] [2019-10-15 03:27:39,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:39,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:39,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:39,394 INFO L87 Difference]: Start difference. First operand 5764 states and 6706 transitions. Second operand 4 states. [2019-10-15 03:27:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:39,681 INFO L93 Difference]: Finished difference Result 11106 states and 12961 transitions. [2019-10-15 03:27:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:39,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-15 03:27:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:39,704 INFO L225 Difference]: With dead ends: 11106 [2019-10-15 03:27:39,704 INFO L226 Difference]: Without dead ends: 5626 [2019-10-15 03:27:39,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-10-15 03:27:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5222. [2019-10-15 03:27:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-10-15 03:27:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 5897 transitions. [2019-10-15 03:27:40,102 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 5897 transitions. Word has length 134 [2019-10-15 03:27:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:40,103 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 5897 transitions. [2019-10-15 03:27:40,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 5897 transitions. [2019-10-15 03:27:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 03:27:40,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:40,107 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:40,108 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash -161297964, now seen corresponding path program 1 times [2019-10-15 03:27:40,108 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:40,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307196819] [2019-10-15 03:27:40,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:40,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:40,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-15 03:27:40,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307196819] [2019-10-15 03:27:40,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110178187] [2019-10-15 03:27:40,289 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:27:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:40,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-15 03:27:40,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:27:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 03:27:40,844 INFO L321 TraceCheckSpWp]: Computing backward predicates...