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_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:12,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:12,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:12,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:12,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:12,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:12,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:12,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:12,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:12,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:12,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:12,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:12,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:12,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:12,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:12,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:12,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:12,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:12,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:12,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:12,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:12,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:12,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:12,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:12,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:12,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:12,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:12,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:12,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:12,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:12,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:12,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:12,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:12,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:12,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:12,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:12,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:12,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:12,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:12,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:12,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:12,294 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:12,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:12,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:12,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:12,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:12,310 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:12,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:12,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:12,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:12,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:12,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:12,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:12,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:12,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:12,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:12,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:12,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:12,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:12,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:12,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:12,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:12,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:12,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:12,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:12,315 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:12,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:12,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:12,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:12,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:12,619 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:12,620 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_2.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:12,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f27f3086/cb44da13cbcf40839eb61a272c435eb7/FLAG8cf778013 [2019-10-15 03:27:13,256 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:13,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:13,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f27f3086/cb44da13cbcf40839eb61a272c435eb7/FLAG8cf778013 [2019-10-15 03:27:13,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f27f3086/cb44da13cbcf40839eb61a272c435eb7 [2019-10-15 03:27:13,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:13,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:13,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:13,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:13,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:13,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:13" (1/1) ... [2019-10-15 03:27:13,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e53d70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:13, skipping insertion in model container [2019-10-15 03:27:13,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:13" (1/1) ... [2019-10-15 03:27:13,589 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:13,651 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:14,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:14,058 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:14,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:14,244 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:14,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:14 WrapperNode [2019-10-15 03:27:14,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:14,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:14,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:14,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:14,260 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:14" (1/1) ... [2019-10-15 03:27:14,260 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:14" (1/1) ... [2019-10-15 03:27:14,275 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:14" (1/1) ... [2019-10-15 03:27:14,276 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:14" (1/1) ... [2019-10-15 03:27:14,310 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:14" (1/1) ... [2019-10-15 03:27:14,322 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:14" (1/1) ... [2019-10-15 03:27:14,325 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:14" (1/1) ... [2019-10-15 03:27:14,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:14,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:14,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:14,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:14,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:14" (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:14,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:14,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:14,391 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 03:27:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 03:27:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 03:27:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 03:27:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 03:27:14,392 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 03:27:14,393 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:14,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 03:27:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 03:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 03:27:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 03:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 03:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 03:27:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 03:27:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:15,816 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:15,816 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:27:15,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:15 BoogieIcfgContainer [2019-10-15 03:27:15,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:15,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:15,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:15,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:15,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:13" (1/3) ... [2019-10-15 03:27:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fc650d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:15, skipping insertion in model container [2019-10-15 03:27:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:14" (2/3) ... [2019-10-15 03:27:15,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fc650d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:15, skipping insertion in model container [2019-10-15 03:27:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:15" (3/3) ... [2019-10-15 03:27:15,827 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:15,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:15,849 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:15,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:15,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:15,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:15,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:15,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:15,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:15,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:15,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:15,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-10-15 03:27:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:27:15,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,932 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:15,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1554589373, now seen corresponding path program 1 times [2019-10-15 03:27:15,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004440708] [2019-10-15 03:27:15,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:16,554 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:16,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004440708] [2019-10-15 03:27:16,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:16,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:16,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100418468] [2019-10-15 03:27:16,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:16,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:16,584 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 4 states. [2019-10-15 03:27:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:16,743 INFO L93 Difference]: Finished difference Result 360 states and 550 transitions. [2019-10-15 03:27:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:16,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-15 03:27:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:16,771 INFO L225 Difference]: With dead ends: 360 [2019-10-15 03:27:16,771 INFO L226 Difference]: Without dead ends: 185 [2019-10-15 03:27:16,787 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:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-15 03:27:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-10-15 03:27:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-15 03:27:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 263 transitions. [2019-10-15 03:27:16,899 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 263 transitions. Word has length 44 [2019-10-15 03:27:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:16,900 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 263 transitions. [2019-10-15 03:27:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2019-10-15 03:27:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:16,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:16,905 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] [2019-10-15 03:27:16,905 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1078758557, now seen corresponding path program 1 times [2019-10-15 03:27:16,907 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:16,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860600876] [2019-10-15 03:27:16,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:16,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,175 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:17,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860600876] [2019-10-15 03:27:17,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:17,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532055184] [2019-10-15 03:27:17,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:17,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:17,185 INFO L87 Difference]: Start difference. First operand 185 states and 263 transitions. Second operand 7 states. [2019-10-15 03:27:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,459 INFO L93 Difference]: Finished difference Result 416 states and 590 transitions. [2019-10-15 03:27:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:27:18,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-15 03:27:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,465 INFO L225 Difference]: With dead ends: 416 [2019-10-15 03:27:18,466 INFO L226 Difference]: Without dead ends: 240 [2019-10-15 03:27:18,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-15 03:27:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-15 03:27:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-15 03:27:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-15 03:27:18,523 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 59 [2019-10-15 03:27:18,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,524 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-15 03:27:18,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-15 03:27:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:27:18,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,526 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:18,527 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1695939672, now seen corresponding path program 1 times [2019-10-15 03:27:18,528 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118429635] [2019-10-15 03:27:18,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,640 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:18,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118429635] [2019-10-15 03:27:18,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:18,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094842153] [2019-10-15 03:27:18,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:18,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:18,643 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 7 states. [2019-10-15 03:27:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,654 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2019-10-15 03:27:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:27:19,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-15 03:27:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,657 INFO L225 Difference]: With dead ends: 422 [2019-10-15 03:27:19,658 INFO L226 Difference]: Without dead ends: 243 [2019-10-15 03:27:19,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-15 03:27:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-10-15 03:27:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-15 03:27:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-15 03:27:19,704 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 60 [2019-10-15 03:27:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,707 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-15 03:27:19,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-15 03:27:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:27:19,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,710 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] [2019-10-15 03:27:19,711 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1240740783, now seen corresponding path program 1 times [2019-10-15 03:27:19,711 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253706448] [2019-10-15 03:27:19,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:19,856 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:19,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253706448] [2019-10-15 03:27:19,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:19,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:19,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588019579] [2019-10-15 03:27:19,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:19,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:19,859 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 5 states. [2019-10-15 03:27:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,973 INFO L93 Difference]: Finished difference Result 826 states and 1164 transitions. [2019-10-15 03:27:19,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:19,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:27:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,980 INFO L225 Difference]: With dead ends: 826 [2019-10-15 03:27:19,980 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 03:27:19,981 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:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 03:27:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 454. [2019-10-15 03:27:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-15 03:27:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 634 transitions. [2019-10-15 03:27:20,049 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 634 transitions. Word has length 62 [2019-10-15 03:27:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:20,049 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 634 transitions. [2019-10-15 03:27:20,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 634 transitions. [2019-10-15 03:27:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 03:27:20,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:20,052 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] [2019-10-15 03:27:20,052 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1725288910, now seen corresponding path program 1 times [2019-10-15 03:27:20,053 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:20,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992186592] [2019-10-15 03:27:20,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,146 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:20,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992186592] [2019-10-15 03:27:20,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:20,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951309945] [2019-10-15 03:27:20,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:20,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:20,151 INFO L87 Difference]: Start difference. First operand 454 states and 634 transitions. Second operand 4 states. [2019-10-15 03:27:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:20,211 INFO L93 Difference]: Finished difference Result 828 states and 1171 transitions. [2019-10-15 03:27:20,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:20,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-15 03:27:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:20,218 INFO L225 Difference]: With dead ends: 828 [2019-10-15 03:27:20,218 INFO L226 Difference]: Without dead ends: 464 [2019-10-15 03:27:20,220 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:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-15 03:27:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-10-15 03:27:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-15 03:27:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 642 transitions. [2019-10-15 03:27:20,280 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 642 transitions. Word has length 64 [2019-10-15 03:27:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:20,281 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 642 transitions. [2019-10-15 03:27:20,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 642 transitions. [2019-10-15 03:27:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:27:20,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:20,290 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] [2019-10-15 03:27:20,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1712819026, now seen corresponding path program 1 times [2019-10-15 03:27:20,292 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:20,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331687015] [2019-10-15 03:27:20,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,435 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:20,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331687015] [2019-10-15 03:27:20,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:20,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502401721] [2019-10-15 03:27:20,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:20,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:20,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:20,439 INFO L87 Difference]: Start difference. First operand 464 states and 642 transitions. Second operand 4 states. [2019-10-15 03:27:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:20,553 INFO L93 Difference]: Finished difference Result 848 states and 1193 transitions. [2019-10-15 03:27:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:20,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-15 03:27:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:20,557 INFO L225 Difference]: With dead ends: 848 [2019-10-15 03:27:20,557 INFO L226 Difference]: Without dead ends: 474 [2019-10-15 03:27:20,559 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:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-15 03:27:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-15 03:27:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-15 03:27:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 650 transitions. [2019-10-15 03:27:20,606 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 650 transitions. Word has length 72 [2019-10-15 03:27:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:20,609 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 650 transitions. [2019-10-15 03:27:20,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 650 transitions. [2019-10-15 03:27:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:27:20,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:20,614 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:20,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1368606264, now seen corresponding path program 1 times [2019-10-15 03:27:20,615 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:20,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297914667] [2019-10-15 03:27:20,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,731 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:20,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297914667] [2019-10-15 03:27:20,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:20,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698857992] [2019-10-15 03:27:20,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:20,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:20,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:20,735 INFO L87 Difference]: Start difference. First operand 474 states and 650 transitions. Second operand 4 states. [2019-10-15 03:27:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:20,800 INFO L93 Difference]: Finished difference Result 866 states and 1201 transitions. [2019-10-15 03:27:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:20,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-15 03:27:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:20,806 INFO L225 Difference]: With dead ends: 866 [2019-10-15 03:27:20,806 INFO L226 Difference]: Without dead ends: 482 [2019-10-15 03:27:20,808 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:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-15 03:27:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-15 03:27:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-15 03:27:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2019-10-15 03:27:20,849 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 80 [2019-10-15 03:27:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:20,850 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2019-10-15 03:27:20,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2019-10-15 03:27:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:27:20,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:20,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:20,852 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash -361072044, now seen corresponding path program 1 times [2019-10-15 03:27:20,853 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:20,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832226372] [2019-10-15 03:27:20,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:20,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,958 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:20,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832226372] [2019-10-15 03:27:20,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:20,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721273773] [2019-10-15 03:27:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:20,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:20,961 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand 4 states. [2019-10-15 03:27:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:21,030 INFO L93 Difference]: Finished difference Result 884 states and 1221 transitions. [2019-10-15 03:27:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:21,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-15 03:27:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:21,035 INFO L225 Difference]: With dead ends: 884 [2019-10-15 03:27:21,035 INFO L226 Difference]: Without dead ends: 492 [2019-10-15 03:27:21,038 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:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-15 03:27:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2019-10-15 03:27:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-15 03:27:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 664 transitions. [2019-10-15 03:27:21,082 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 664 transitions. Word has length 80 [2019-10-15 03:27:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:21,083 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 664 transitions. [2019-10-15 03:27:21,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 664 transitions. [2019-10-15 03:27:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 03:27:21,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:21,088 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, 1, 1, 1, 1] [2019-10-15 03:27:21,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 743854552, now seen corresponding path program 1 times [2019-10-15 03:27:21,089 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:21,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152491327] [2019-10-15 03:27:21,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:21,200 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:21,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152491327] [2019-10-15 03:27:21,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:21,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:21,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399585048] [2019-10-15 03:27:21,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:21,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:21,205 INFO L87 Difference]: Start difference. First operand 492 states and 664 transitions. Second operand 4 states. [2019-10-15 03:27:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:21,267 INFO L93 Difference]: Finished difference Result 906 states and 1235 transitions. [2019-10-15 03:27:21,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:21,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 03:27:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:21,273 INFO L225 Difference]: With dead ends: 906 [2019-10-15 03:27:21,274 INFO L226 Difference]: Without dead ends: 504 [2019-10-15 03:27:21,276 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:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-15 03:27:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-10-15 03:27:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-15 03:27:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 674 transitions. [2019-10-15 03:27:21,318 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 674 transitions. Word has length 88 [2019-10-15 03:27:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:21,320 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 674 transitions. [2019-10-15 03:27:21,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 674 transitions. [2019-10-15 03:27:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 03:27:21,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:21,324 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, 1, 1, 1, 1] [2019-10-15 03:27:21,325 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1350881815, now seen corresponding path program 1 times [2019-10-15 03:27:21,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:21,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365168828] [2019-10-15 03:27:21,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:21,687 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:21,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365168828] [2019-10-15 03:27:21,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:21,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:21,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199732696] [2019-10-15 03:27:21,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:21,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:21,691 INFO L87 Difference]: Start difference. First operand 504 states and 674 transitions. Second operand 12 states. [2019-10-15 03:27:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,457 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2019-10-15 03:27:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:24,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-15 03:27:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,464 INFO L225 Difference]: With dead ends: 1340 [2019-10-15 03:27:24,465 INFO L226 Difference]: Without dead ends: 920 [2019-10-15 03:27:24,467 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:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-15 03:27:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 854. [2019-10-15 03:27:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-15 03:27:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1118 transitions. [2019-10-15 03:27:24,549 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1118 transitions. Word has length 93 [2019-10-15 03:27:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,549 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1118 transitions. [2019-10-15 03:27:24,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1118 transitions. [2019-10-15 03:27:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 03:27:24,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,551 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] [2019-10-15 03:27:24,552 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -590163429, now seen corresponding path program 1 times [2019-10-15 03:27:24,552 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861674979] [2019-10-15 03:27:24,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,631 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:24,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861674979] [2019-10-15 03:27:24,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790759582] [2019-10-15 03:27:24,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,634 INFO L87 Difference]: Start difference. First operand 854 states and 1118 transitions. Second operand 4 states. [2019-10-15 03:27:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,715 INFO L93 Difference]: Finished difference Result 1562 states and 2055 transitions. [2019-10-15 03:27:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:24,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-15 03:27:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,722 INFO L225 Difference]: With dead ends: 1562 [2019-10-15 03:27:24,723 INFO L226 Difference]: Without dead ends: 862 [2019-10-15 03:27:24,726 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:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-15 03:27:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-15 03:27:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-15 03:27:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1114 transitions. [2019-10-15 03:27:24,789 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1114 transitions. Word has length 95 [2019-10-15 03:27:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1114 transitions. [2019-10-15 03:27:24,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1114 transitions. [2019-10-15 03:27:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 03:27:24,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,792 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:24,792 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash -272810448, now seen corresponding path program 1 times [2019-10-15 03:27:24,793 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467224728] [2019-10-15 03:27:24,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,874 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:24,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467224728] [2019-10-15 03:27:24,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860736313] [2019-10-15 03:27:24,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,877 INFO L87 Difference]: Start difference. First operand 862 states and 1114 transitions. Second operand 4 states. [2019-10-15 03:27:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,943 INFO L93 Difference]: Finished difference Result 1528 states and 1981 transitions. [2019-10-15 03:27:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:24,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-15 03:27:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,948 INFO L225 Difference]: With dead ends: 1528 [2019-10-15 03:27:24,949 INFO L226 Difference]: Without dead ends: 854 [2019-10-15 03:27:24,951 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:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-15 03:27:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-10-15 03:27:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-15 03:27:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1090 transitions. [2019-10-15 03:27:25,009 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1090 transitions. Word has length 97 [2019-10-15 03:27:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,009 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1090 transitions. [2019-10-15 03:27:25,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1090 transitions. [2019-10-15 03:27:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:27:25,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,013 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, 1, 1, 1, 1] [2019-10-15 03:27:25,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 564471986, now seen corresponding path program 1 times [2019-10-15 03:27:25,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332108443] [2019-10-15 03:27:25,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,162 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:25,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332108443] [2019-10-15 03:27:25,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:25,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15710354] [2019-10-15 03:27:25,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:25,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:25,166 INFO L87 Difference]: Start difference. First operand 854 states and 1090 transitions. Second operand 7 states. [2019-10-15 03:27:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,292 INFO L93 Difference]: Finished difference Result 912 states and 1174 transitions. [2019-10-15 03:27:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:27:25,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 03:27:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,300 INFO L225 Difference]: With dead ends: 912 [2019-10-15 03:27:25,300 INFO L226 Difference]: Without dead ends: 910 [2019-10-15 03:27:25,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-15 03:27:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 874. [2019-10-15 03:27:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-15 03:27:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1112 transitions. [2019-10-15 03:27:25,361 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1112 transitions. Word has length 96 [2019-10-15 03:27:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,362 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1112 transitions. [2019-10-15 03:27:25,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1112 transitions. [2019-10-15 03:27:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 03:27:25,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,364 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:25,365 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1749399501, now seen corresponding path program 1 times [2019-10-15 03:27:25,365 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796277035] [2019-10-15 03:27:25,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,639 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:25,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796277035] [2019-10-15 03:27:25,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:25,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886170521] [2019-10-15 03:27:25,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:25,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:25,641 INFO L87 Difference]: Start difference. First operand 874 states and 1112 transitions. Second operand 12 states. [2019-10-15 03:27:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:29,113 INFO L93 Difference]: Finished difference Result 2474 states and 3108 transitions. [2019-10-15 03:27:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:29,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-15 03:27:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:29,128 INFO L225 Difference]: With dead ends: 2474 [2019-10-15 03:27:29,128 INFO L226 Difference]: Without dead ends: 1788 [2019-10-15 03:27:29,134 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:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-15 03:27:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1399. [2019-10-15 03:27:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-10-15 03:27:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1766 transitions. [2019-10-15 03:27:29,258 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1766 transitions. Word has length 101 [2019-10-15 03:27:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:29,259 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 1766 transitions. [2019-10-15 03:27:29,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1766 transitions. [2019-10-15 03:27:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:29,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:29,263 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:29,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1967235009, now seen corresponding path program 1 times [2019-10-15 03:27:29,265 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:29,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448854432] [2019-10-15 03:27:29,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:29,586 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:29,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448854432] [2019-10-15 03:27:29,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:29,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:29,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855310727] [2019-10-15 03:27:29,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:29,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:29,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:29,591 INFO L87 Difference]: Start difference. First operand 1399 states and 1766 transitions. Second operand 9 states. [2019-10-15 03:27:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:30,972 INFO L93 Difference]: Finished difference Result 3412 states and 4357 transitions. [2019-10-15 03:27:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:30,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-15 03:27:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:30,985 INFO L225 Difference]: With dead ends: 3412 [2019-10-15 03:27:30,985 INFO L226 Difference]: Without dead ends: 2220 [2019-10-15 03:27:30,993 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:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-10-15 03:27:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1961. [2019-10-15 03:27:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-10-15 03:27:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2468 transitions. [2019-10-15 03:27:31,126 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2468 transitions. Word has length 102 [2019-10-15 03:27:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:31,127 INFO L462 AbstractCegarLoop]: Abstraction has 1961 states and 2468 transitions. [2019-10-15 03:27:31,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2468 transitions. [2019-10-15 03:27:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:31,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:31,131 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,131 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1053485956, now seen corresponding path program 1 times [2019-10-15 03:27:31,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:31,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911025334] [2019-10-15 03:27:31,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:31,261 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,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911025334] [2019-10-15 03:27:31,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:31,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:31,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238644250] [2019-10-15 03:27:31,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:31,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:31,273 INFO L87 Difference]: Start difference. First operand 1961 states and 2468 transitions. Second operand 5 states. [2019-10-15 03:27:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:31,874 INFO L93 Difference]: Finished difference Result 6105 states and 7758 transitions. [2019-10-15 03:27:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:31,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:31,898 INFO L225 Difference]: With dead ends: 6105 [2019-10-15 03:27:31,898 INFO L226 Difference]: Without dead ends: 4396 [2019-10-15 03:27:31,908 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,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-10-15 03:27:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4052. [2019-10-15 03:27:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2019-10-15 03:27:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 5124 transitions. [2019-10-15 03:27:32,158 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 5124 transitions. Word has length 102 [2019-10-15 03:27:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:32,158 INFO L462 AbstractCegarLoop]: Abstraction has 4052 states and 5124 transitions. [2019-10-15 03:27:32,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 5124 transitions. [2019-10-15 03:27:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:27:32,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:32,162 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:32,162 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 822083386, now seen corresponding path program 1 times [2019-10-15 03:27:32,162 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:32,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725049192] [2019-10-15 03:27:32,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:32,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:32,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:32,331 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:32,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725049192] [2019-10-15 03:27:32,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:32,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:32,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158655503] [2019-10-15 03:27:32,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:32,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:32,334 INFO L87 Difference]: Start difference. First operand 4052 states and 5124 transitions. Second operand 9 states. [2019-10-15 03:27:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:33,719 INFO L93 Difference]: Finished difference Result 7670 states and 9786 transitions. [2019-10-15 03:27:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:33,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-15 03:27:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:33,745 INFO L225 Difference]: With dead ends: 7670 [2019-10-15 03:27:33,745 INFO L226 Difference]: Without dead ends: 4133 [2019-10-15 03:27:33,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-10-15 03:27:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 3639. [2019-10-15 03:27:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-15 03:27:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4579 transitions. [2019-10-15 03:27:34,023 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4579 transitions. Word has length 104 [2019-10-15 03:27:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:34,024 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 4579 transitions. [2019-10-15 03:27:34,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4579 transitions. [2019-10-15 03:27:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:34,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:34,028 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, 1, 1, 1, 1] [2019-10-15 03:27:34,029 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1741111612, now seen corresponding path program 1 times [2019-10-15 03:27:34,030 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:34,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817129615] [2019-10-15 03:27:34,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:34,146 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:34,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817129615] [2019-10-15 03:27:34,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:34,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:34,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640488684] [2019-10-15 03:27:34,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:34,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:34,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:34,148 INFO L87 Difference]: Start difference. First operand 3639 states and 4579 transitions. Second operand 4 states. [2019-10-15 03:27:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:34,363 INFO L93 Difference]: Finished difference Result 6778 states and 8592 transitions. [2019-10-15 03:27:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:34,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 03:27:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:34,385 INFO L225 Difference]: With dead ends: 6778 [2019-10-15 03:27:34,385 INFO L226 Difference]: Without dead ends: 3581 [2019-10-15 03:27:34,396 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:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-10-15 03:27:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2019-10-15 03:27:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-10-15 03:27:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 4405 transitions. [2019-10-15 03:27:34,664 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 4405 transitions. Word has length 106 [2019-10-15 03:27:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:34,665 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 4405 transitions. [2019-10-15 03:27:34,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 4405 transitions. [2019-10-15 03:27:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:34,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:34,669 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, 1] [2019-10-15 03:27:34,670 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:34,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 317418295, now seen corresponding path program 1 times [2019-10-15 03:27:34,670 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:34,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560359796] [2019-10-15 03:27:34,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:34,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:34,751 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,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560359796] [2019-10-15 03:27:34,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:34,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:34,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729017267] [2019-10-15 03:27:34,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:34,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:34,755 INFO L87 Difference]: Start difference. First operand 3581 states and 4405 transitions. Second operand 5 states. [2019-10-15 03:27:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:35,334 INFO L93 Difference]: Finished difference Result 10843 states and 13339 transitions. [2019-10-15 03:27:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:35,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 03:27:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:35,387 INFO L225 Difference]: With dead ends: 10843 [2019-10-15 03:27:35,387 INFO L226 Difference]: Without dead ends: 7777 [2019-10-15 03:27:35,399 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:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2019-10-15 03:27:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 6122. [2019-10-15 03:27:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6122 states. [2019-10-15 03:27:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 7525 transitions. [2019-10-15 03:27:35,887 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 7525 transitions. Word has length 106 [2019-10-15 03:27:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:35,887 INFO L462 AbstractCegarLoop]: Abstraction has 6122 states and 7525 transitions. [2019-10-15 03:27:35,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 7525 transitions. [2019-10-15 03:27:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:35,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:35,892 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, 1] [2019-10-15 03:27:35,892 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1612477254, now seen corresponding path program 1 times [2019-10-15 03:27:35,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:35,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668204884] [2019-10-15 03:27:35,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:35,973 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:35,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668204884] [2019-10-15 03:27:35,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:35,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:35,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215634363] [2019-10-15 03:27:35,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:35,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:35,976 INFO L87 Difference]: Start difference. First operand 6122 states and 7525 transitions. Second operand 5 states. [2019-10-15 03:27:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:36,640 INFO L93 Difference]: Finished difference Result 14100 states and 17318 transitions. [2019-10-15 03:27:36,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:36,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 03:27:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:36,680 INFO L225 Difference]: With dead ends: 14100 [2019-10-15 03:27:36,680 INFO L226 Difference]: Without dead ends: 8710 [2019-10-15 03:27:36,699 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:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-10-15 03:27:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 8358. [2019-10-15 03:27:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8358 states. [2019-10-15 03:27:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 10251 transitions. [2019-10-15 03:27:37,274 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 10251 transitions. Word has length 106 [2019-10-15 03:27:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:37,275 INFO L462 AbstractCegarLoop]: Abstraction has 8358 states and 10251 transitions. [2019-10-15 03:27:37,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 10251 transitions. [2019-10-15 03:27:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 03:27:37,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:37,280 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, 1, 1] [2019-10-15 03:27:37,280 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1928416921, now seen corresponding path program 1 times [2019-10-15 03:27:37,281 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:37,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585348271] [2019-10-15 03:27:37,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:37,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:37,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:37,335 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:37,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585348271] [2019-10-15 03:27:37,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:37,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:37,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104383725] [2019-10-15 03:27:37,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:37,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:37,338 INFO L87 Difference]: Start difference. First operand 8358 states and 10251 transitions. Second operand 3 states. [2019-10-15 03:27:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:37,608 INFO L93 Difference]: Finished difference Result 15994 states and 19556 transitions. [2019-10-15 03:27:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:37,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 03:27:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:37,646 INFO L225 Difference]: With dead ends: 15994 [2019-10-15 03:27:37,646 INFO L226 Difference]: Without dead ends: 8397 [2019-10-15 03:27:37,668 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:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2019-10-15 03:27:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 8364. [2019-10-15 03:27:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8364 states. [2019-10-15 03:27:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8364 states to 8364 states and 10257 transitions. [2019-10-15 03:27:38,697 INFO L78 Accepts]: Start accepts. Automaton has 8364 states and 10257 transitions. Word has length 107 [2019-10-15 03:27:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:38,697 INFO L462 AbstractCegarLoop]: Abstraction has 8364 states and 10257 transitions. [2019-10-15 03:27:38,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8364 states and 10257 transitions. [2019-10-15 03:27:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 03:27:38,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:38,702 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, 1, 1, 1] [2019-10-15 03:27:38,703 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2043218370, now seen corresponding path program 1 times [2019-10-15 03:27:38,703 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:38,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602918608] [2019-10-15 03:27:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:38,887 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:38,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602918608] [2019-10-15 03:27:38,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:38,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:38,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664674011] [2019-10-15 03:27:38,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:38,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:38,889 INFO L87 Difference]: Start difference. First operand 8364 states and 10257 transitions. Second operand 9 states. [2019-10-15 03:27:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:40,477 INFO L93 Difference]: Finished difference Result 15918 states and 19435 transitions. [2019-10-15 03:27:40,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:27:40,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-15 03:27:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:40,506 INFO L225 Difference]: With dead ends: 15918 [2019-10-15 03:27:40,506 INFO L226 Difference]: Without dead ends: 7752 [2019-10-15 03:27:40,525 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:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2019-10-15 03:27:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7005. [2019-10-15 03:27:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7005 states. [2019-10-15 03:27:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 8523 transitions. [2019-10-15 03:27:40,948 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 8523 transitions. Word has length 108 [2019-10-15 03:27:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:40,948 INFO L462 AbstractCegarLoop]: Abstraction has 7005 states and 8523 transitions. [2019-10-15 03:27:40,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 8523 transitions. [2019-10-15 03:27:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 03:27:40,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:40,951 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, 1, 1, 1, 1] [2019-10-15 03:27:40,951 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1292914891, now seen corresponding path program 1 times [2019-10-15 03:27:40,952 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:40,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125246329] [2019-10-15 03:27:40,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:40,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:40,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:41,013 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:41,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125246329] [2019-10-15 03:27:41,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:41,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:41,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226881669] [2019-10-15 03:27:41,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:41,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:41,015 INFO L87 Difference]: Start difference. First operand 7005 states and 8523 transitions. Second operand 3 states. [2019-10-15 03:27:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:41,501 INFO L93 Difference]: Finished difference Result 13744 states and 16706 transitions. [2019-10-15 03:27:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:41,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 03:27:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:41,532 INFO L225 Difference]: With dead ends: 13744 [2019-10-15 03:27:41,532 INFO L226 Difference]: Without dead ends: 7047 [2019-10-15 03:27:41,551 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:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2019-10-15 03:27:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 7011. [2019-10-15 03:27:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7011 states. [2019-10-15 03:27:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 8529 transitions. [2019-10-15 03:27:42,193 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 8529 transitions. Word has length 109 [2019-10-15 03:27:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:42,194 INFO L462 AbstractCegarLoop]: Abstraction has 7011 states and 8529 transitions. [2019-10-15 03:27:42,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 8529 transitions. [2019-10-15 03:27:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 03:27:42,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:42,196 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, 1, 1, 1, 1] [2019-10-15 03:27:42,197 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1009964240, now seen corresponding path program 1 times [2019-10-15 03:27:42,198 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:42,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261429491] [2019-10-15 03:27:42,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:42,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:42,400 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:42,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261429491] [2019-10-15 03:27:42,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:42,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:27:42,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25097668] [2019-10-15 03:27:42,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:27:42,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:42,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:27:42,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:27:42,402 INFO L87 Difference]: Start difference. First operand 7011 states and 8529 transitions. Second operand 8 states. [2019-10-15 03:27:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:43,770 INFO L93 Difference]: Finished difference Result 13754 states and 16703 transitions. [2019-10-15 03:27:43,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:27:43,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-10-15 03:27:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:43,797 INFO L225 Difference]: With dead ends: 13754 [2019-10-15 03:27:43,797 INFO L226 Difference]: Without dead ends: 7049 [2019-10-15 03:27:43,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states.