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-36ac518-m [2019-10-07 15:54:18,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:18,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:18,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:18,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:18,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:18,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:18,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:18,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:18,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:18,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:18,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:18,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:18,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:18,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:18,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:18,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:18,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:18,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:18,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:18,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:18,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:18,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:18,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:18,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:18,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:18,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:18,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:18,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:18,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:18,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:18,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:18,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:18,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:18,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:18,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:18,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:18,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:18,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:18,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:18,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:18,523 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-07 15:54:18,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:18,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:18,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:18,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:18,538 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:18,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:18,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:18,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:18,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:18,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:18,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:18,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:18,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:18,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:18,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:18,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:18,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:18,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:18,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:18,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:18,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:18,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:18,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:18,543 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-07 15:54:18,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:18,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:18,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:18,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:18,830 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:18,831 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-07 15:54:18,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58670e2dd/a72fccffd8ce4dafab2afd4e58178bb1/FLAG6fdd9cf3e [2019-10-07 15:54:19,381 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:19,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:19,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58670e2dd/a72fccffd8ce4dafab2afd4e58178bb1/FLAG6fdd9cf3e [2019-10-07 15:54:19,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58670e2dd/a72fccffd8ce4dafab2afd4e58178bb1 [2019-10-07 15:54:19,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:19,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:19,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:19,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:19,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:19,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:19" (1/1) ... [2019-10-07 15:54:19,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a25fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:19, skipping insertion in model container [2019-10-07 15:54:19,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:19" (1/1) ... [2019-10-07 15:54:19,739 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:19,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:20,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:20,199 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:20,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:20,315 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:20,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20 WrapperNode [2019-10-07 15:54:20,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:20,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:20,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:20,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:20,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (1/1) ... [2019-10-07 15:54:20,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:20,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:20,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:20,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:20,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (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-07 15:54:20,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-07 15:54:20,448 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-07 15:54:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-07 15:54:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:20,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-07 15:54:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-07 15:54:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:21,754 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:21,754 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 15:54:21,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:21 BoogieIcfgContainer [2019-10-07 15:54:21,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:21,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:21,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:21,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:21,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:19" (1/3) ... [2019-10-07 15:54:21,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ad8b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:21, skipping insertion in model container [2019-10-07 15:54:21,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:20" (2/3) ... [2019-10-07 15:54:21,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ad8b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:21, skipping insertion in model container [2019-10-07 15:54:21,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:21" (3/3) ... [2019-10-07 15:54:21,768 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:21,780 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:21,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:21,804 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:21,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:21,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:21,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:21,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:21,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:21,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:21,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:21,843 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-10-07 15:54:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 15:54:21,882 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,883 INFO L385 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-07 15:54:21,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1554589373, now seen corresponding path program 1 times [2019-10-07 15:54:21,900 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,901 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,901 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,901 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,346 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-07 15:54:22,346 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,347 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:22,348 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:22,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:22,368 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 4 states. [2019-10-07 15:54:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:22,502 INFO L93 Difference]: Finished difference Result 360 states and 550 transitions. [2019-10-07 15:54:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:22,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-07 15:54:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:22,519 INFO L225 Difference]: With dead ends: 360 [2019-10-07 15:54:22,520 INFO L226 Difference]: Without dead ends: 185 [2019-10-07 15:54:22,526 INFO L606 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-07 15:54:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-07 15:54:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-10-07 15:54:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-07 15:54:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 263 transitions. [2019-10-07 15:54:22,598 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 263 transitions. Word has length 44 [2019-10-07 15:54:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:22,599 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 263 transitions. [2019-10-07 15:54:22,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2019-10-07 15:54:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 15:54:22,603 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:22,603 INFO L385 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-07 15:54:22,604 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:22,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1078758557, now seen corresponding path program 1 times [2019-10-07 15:54:22,605 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:22,605 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,605 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,605 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,839 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-07 15:54:22,839 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,840 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:22,840 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:22,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:22,847 INFO L87 Difference]: Start difference. First operand 185 states and 263 transitions. Second operand 7 states. [2019-10-07 15:54:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:23,969 INFO L93 Difference]: Finished difference Result 416 states and 590 transitions. [2019-10-07 15:54:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:54:23,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-07 15:54:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:23,974 INFO L225 Difference]: With dead ends: 416 [2019-10-07 15:54:23,975 INFO L226 Difference]: Without dead ends: 240 [2019-10-07 15:54:23,976 INFO L606 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-07 15:54:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-07 15:54:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-07 15:54:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-07 15:54:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-07 15:54:24,015 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 59 [2019-10-07 15:54:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:24,015 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-07 15:54:24,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-07 15:54:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 15:54:24,020 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:24,021 INFO L385 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-07 15:54:24,021 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1695939672, now seen corresponding path program 1 times [2019-10-07 15:54:24,022 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:24,022 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:24,168 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-07 15:54:24,169 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,169 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:24,169 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:24,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:24,170 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 7 states. [2019-10-07 15:54:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,072 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2019-10-07 15:54:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:54:25,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-07 15:54:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,077 INFO L225 Difference]: With dead ends: 422 [2019-10-07 15:54:25,077 INFO L226 Difference]: Without dead ends: 243 [2019-10-07 15:54:25,078 INFO L606 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-07 15:54:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-07 15:54:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-10-07 15:54:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-07 15:54:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-07 15:54:25,104 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 60 [2019-10-07 15:54:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,105 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-07 15:54:25,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-07 15:54:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 15:54:25,107 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,107 INFO L385 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-07 15:54:25,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1240740783, now seen corresponding path program 1 times [2019-10-07 15:54:25,108 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,108 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,210 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-07 15:54:25,211 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,211 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,211 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:25,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:25,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:25,213 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 5 states. [2019-10-07 15:54:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,321 INFO L93 Difference]: Finished difference Result 826 states and 1164 transitions. [2019-10-07 15:54:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:25,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 15:54:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,327 INFO L225 Difference]: With dead ends: 826 [2019-10-07 15:54:25,328 INFO L226 Difference]: Without dead ends: 612 [2019-10-07 15:54:25,329 INFO L606 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-07 15:54:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-07 15:54:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 454. [2019-10-07 15:54:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-07 15:54:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 634 transitions. [2019-10-07 15:54:25,385 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 634 transitions. Word has length 62 [2019-10-07 15:54:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,387 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 634 transitions. [2019-10-07 15:54:25,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 634 transitions. [2019-10-07 15:54:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 15:54:25,393 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,393 INFO L385 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-07 15:54:25,394 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1725288910, now seen corresponding path program 1 times [2019-10-07 15:54:25,397 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,397 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:25,508 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,508 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,508 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,510 INFO L87 Difference]: Start difference. First operand 454 states and 634 transitions. Second operand 4 states. [2019-10-07 15:54:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,562 INFO L93 Difference]: Finished difference Result 828 states and 1171 transitions. [2019-10-07 15:54:25,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-07 15:54:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,566 INFO L225 Difference]: With dead ends: 828 [2019-10-07 15:54:25,566 INFO L226 Difference]: Without dead ends: 464 [2019-10-07 15:54:25,568 INFO L606 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-07 15:54:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-07 15:54:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-10-07 15:54:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-07 15:54:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 642 transitions. [2019-10-07 15:54:25,650 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 642 transitions. Word has length 64 [2019-10-07 15:54:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,651 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 642 transitions. [2019-10-07 15:54:25,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 642 transitions. [2019-10-07 15:54:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 15:54:25,653 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,653 INFO L385 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-07 15:54:25,653 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1712819026, now seen corresponding path program 1 times [2019-10-07 15:54:25,654 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,654 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,654 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,654 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:25,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,771 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,771 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,773 INFO L87 Difference]: Start difference. First operand 464 states and 642 transitions. Second operand 4 states. [2019-10-07 15:54:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,833 INFO L93 Difference]: Finished difference Result 848 states and 1193 transitions. [2019-10-07 15:54:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-07 15:54:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,838 INFO L225 Difference]: With dead ends: 848 [2019-10-07 15:54:25,838 INFO L226 Difference]: Without dead ends: 474 [2019-10-07 15:54:25,840 INFO L606 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-07 15:54:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-07 15:54:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-07 15:54:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-07 15:54:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 650 transitions. [2019-10-07 15:54:25,872 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 650 transitions. Word has length 72 [2019-10-07 15:54:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,873 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 650 transitions. [2019-10-07 15:54:25,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 650 transitions. [2019-10-07 15:54:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 15:54:25,875 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,875 INFO L385 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-07 15:54:25,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1368606264, now seen corresponding path program 1 times [2019-10-07 15:54:25,876 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,876 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,876 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,946 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-07 15:54:25,946 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,946 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,946 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,948 INFO L87 Difference]: Start difference. First operand 474 states and 650 transitions. Second operand 4 states. [2019-10-07 15:54:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:26,003 INFO L93 Difference]: Finished difference Result 866 states and 1201 transitions. [2019-10-07 15:54:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:26,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 15:54:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:26,008 INFO L225 Difference]: With dead ends: 866 [2019-10-07 15:54:26,008 INFO L226 Difference]: Without dead ends: 482 [2019-10-07 15:54:26,010 INFO L606 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-07 15:54:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-07 15:54:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-07 15:54:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-07 15:54:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2019-10-07 15:54:26,049 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 80 [2019-10-07 15:54:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:26,049 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2019-10-07 15:54:26,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2019-10-07 15:54:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 15:54:26,054 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:26,055 INFO L385 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-07 15:54:26,055 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash -361072044, now seen corresponding path program 1 times [2019-10-07 15:54:26,055 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:26,056 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,056 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,056 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:26,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-07 15:54:26,176 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,176 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:26,176 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:26,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:26,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:26,178 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand 4 states. [2019-10-07 15:54:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:26,241 INFO L93 Difference]: Finished difference Result 884 states and 1221 transitions. [2019-10-07 15:54:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:26,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 15:54:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:26,246 INFO L225 Difference]: With dead ends: 884 [2019-10-07 15:54:26,246 INFO L226 Difference]: Without dead ends: 492 [2019-10-07 15:54:26,248 INFO L606 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-07 15:54:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-07 15:54:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2019-10-07 15:54:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-07 15:54:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 664 transitions. [2019-10-07 15:54:26,282 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 664 transitions. Word has length 80 [2019-10-07 15:54:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:26,283 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 664 transitions. [2019-10-07 15:54:26,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 664 transitions. [2019-10-07 15:54:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 15:54:26,285 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:26,285 INFO L385 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-07 15:54:26,285 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 743854552, now seen corresponding path program 1 times [2019-10-07 15:54:26,286 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:26,286 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,286 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,286 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:26,392 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-07 15:54:26,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,393 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:26,393 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:26,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:26,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:26,394 INFO L87 Difference]: Start difference. First operand 492 states and 664 transitions. Second operand 4 states. [2019-10-07 15:54:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:26,456 INFO L93 Difference]: Finished difference Result 906 states and 1235 transitions. [2019-10-07 15:54:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:26,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 15:54:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:26,467 INFO L225 Difference]: With dead ends: 906 [2019-10-07 15:54:26,467 INFO L226 Difference]: Without dead ends: 504 [2019-10-07 15:54:26,469 INFO L606 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-07 15:54:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-07 15:54:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-10-07 15:54:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-07 15:54:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 674 transitions. [2019-10-07 15:54:26,499 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 674 transitions. Word has length 88 [2019-10-07 15:54:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:26,500 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 674 transitions. [2019-10-07 15:54:26,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 674 transitions. [2019-10-07 15:54:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-07 15:54:26,505 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:26,506 INFO L385 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-07 15:54:26,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1350881815, now seen corresponding path program 1 times [2019-10-07 15:54:26,507 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:26,507 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,507 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,507 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:26,798 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-07 15:54:26,799 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,799 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:26,799 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:26,800 INFO L87 Difference]: Start difference. First operand 504 states and 674 transitions. Second operand 12 states. [2019-10-07 15:54:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,430 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2019-10-07 15:54:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:29,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-07 15:54:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,441 INFO L225 Difference]: With dead ends: 1340 [2019-10-07 15:54:29,441 INFO L226 Difference]: Without dead ends: 920 [2019-10-07 15:54:29,444 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-07 15:54:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 854. [2019-10-07 15:54:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-07 15:54:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1118 transitions. [2019-10-07 15:54:29,500 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1118 transitions. Word has length 93 [2019-10-07 15:54:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,500 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1118 transitions. [2019-10-07 15:54:29,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1118 transitions. [2019-10-07 15:54:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-07 15:54:29,503 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,503 INFO L385 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-07 15:54:29,504 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -590163429, now seen corresponding path program 1 times [2019-10-07 15:54:29,504 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,504 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,504 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,599 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-07 15:54:29,600 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,600 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,600 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:29,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:29,602 INFO L87 Difference]: Start difference. First operand 854 states and 1118 transitions. Second operand 4 states. [2019-10-07 15:54:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,681 INFO L93 Difference]: Finished difference Result 1562 states and 2055 transitions. [2019-10-07 15:54:29,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:29,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-07 15:54:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,689 INFO L225 Difference]: With dead ends: 1562 [2019-10-07 15:54:29,689 INFO L226 Difference]: Without dead ends: 862 [2019-10-07 15:54:29,693 INFO L606 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-07 15:54:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-07 15:54:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-07 15:54:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-07 15:54:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1114 transitions. [2019-10-07 15:54:29,776 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1114 transitions. Word has length 95 [2019-10-07 15:54:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,777 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1114 transitions. [2019-10-07 15:54:29,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1114 transitions. [2019-10-07 15:54:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 15:54:29,780 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,780 INFO L385 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-07 15:54:29,780 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash -272810448, now seen corresponding path program 1 times [2019-10-07 15:54:29,782 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,782 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,912 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-07 15:54:29,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,913 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,913 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:29,915 INFO L87 Difference]: Start difference. First operand 862 states and 1114 transitions. Second operand 4 states. [2019-10-07 15:54:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,995 INFO L93 Difference]: Finished difference Result 1528 states and 1981 transitions. [2019-10-07 15:54:29,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:29,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-07 15:54:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:30,001 INFO L225 Difference]: With dead ends: 1528 [2019-10-07 15:54:30,001 INFO L226 Difference]: Without dead ends: 854 [2019-10-07 15:54:30,004 INFO L606 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-07 15:54:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-07 15:54:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-10-07 15:54:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-07 15:54:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1090 transitions. [2019-10-07 15:54:30,098 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1090 transitions. Word has length 97 [2019-10-07 15:54:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:30,098 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1090 transitions. [2019-10-07 15:54:30,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1090 transitions. [2019-10-07 15:54:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 15:54:30,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:30,100 INFO L385 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-07 15:54:30,101 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 564471986, now seen corresponding path program 1 times [2019-10-07 15:54:30,101 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:30,101 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,102 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,102 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:30,217 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-07 15:54:30,217 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,218 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:30,218 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:30,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:30,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:30,219 INFO L87 Difference]: Start difference. First operand 854 states and 1090 transitions. Second operand 7 states. [2019-10-07 15:54:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:30,306 INFO L93 Difference]: Finished difference Result 912 states and 1174 transitions. [2019-10-07 15:54:30,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 15:54:30,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-07 15:54:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:30,311 INFO L225 Difference]: With dead ends: 912 [2019-10-07 15:54:30,311 INFO L226 Difference]: Without dead ends: 910 [2019-10-07 15:54:30,312 INFO L606 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-07 15:54:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-07 15:54:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 874. [2019-10-07 15:54:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-07 15:54:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1112 transitions. [2019-10-07 15:54:30,362 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1112 transitions. Word has length 96 [2019-10-07 15:54:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:30,362 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1112 transitions. [2019-10-07 15:54:30,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1112 transitions. [2019-10-07 15:54:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-07 15:54:30,364 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:30,364 INFO L385 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-07 15:54:30,364 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1749399501, now seen corresponding path program 1 times [2019-10-07 15:54:30,365 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:30,365 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:30,584 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-07 15:54:30,584 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,584 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:30,584 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:30,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:30,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:30,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:30,585 INFO L87 Difference]: Start difference. First operand 874 states and 1112 transitions. Second operand 12 states. [2019-10-07 15:54:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:33,765 INFO L93 Difference]: Finished difference Result 2474 states and 3108 transitions. [2019-10-07 15:54:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:33,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-07 15:54:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:33,775 INFO L225 Difference]: With dead ends: 2474 [2019-10-07 15:54:33,775 INFO L226 Difference]: Without dead ends: 1788 [2019-10-07 15:54:33,784 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-07 15:54:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1399. [2019-10-07 15:54:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-10-07 15:54:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1766 transitions. [2019-10-07 15:54:33,865 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1766 transitions. Word has length 101 [2019-10-07 15:54:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:33,866 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 1766 transitions. [2019-10-07 15:54:33,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1766 transitions. [2019-10-07 15:54:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:33,868 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:33,868 INFO L385 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-07 15:54:33,868 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1967235009, now seen corresponding path program 1 times [2019-10-07 15:54:33,869 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:33,869 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:33,869 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,869 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:34,108 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-07 15:54:34,109 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,109 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:34,109 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:34,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:34,112 INFO L87 Difference]: Start difference. First operand 1399 states and 1766 transitions. Second operand 9 states. [2019-10-07 15:54:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:35,354 INFO L93 Difference]: Finished difference Result 3412 states and 4357 transitions. [2019-10-07 15:54:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:35,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-07 15:54:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:35,368 INFO L225 Difference]: With dead ends: 3412 [2019-10-07 15:54:35,368 INFO L226 Difference]: Without dead ends: 2220 [2019-10-07 15:54:35,372 INFO L606 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-07 15:54:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-10-07 15:54:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1961. [2019-10-07 15:54:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-10-07 15:54:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2468 transitions. [2019-10-07 15:54:35,494 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2468 transitions. Word has length 102 [2019-10-07 15:54:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:35,495 INFO L462 AbstractCegarLoop]: Abstraction has 1961 states and 2468 transitions. [2019-10-07 15:54:35,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:35,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2468 transitions. [2019-10-07 15:54:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:35,497 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:35,497 INFO L385 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-07 15:54:35,498 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1053485956, now seen corresponding path program 1 times [2019-10-07 15:54:35,498 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:35,498 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:35,499 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,499 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:35,566 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-07 15:54:35,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:35,567 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:35,567 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:35,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:35,568 INFO L87 Difference]: Start difference. First operand 1961 states and 2468 transitions. Second operand 5 states. [2019-10-07 15:54:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:36,120 INFO L93 Difference]: Finished difference Result 6105 states and 7758 transitions. [2019-10-07 15:54:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:36,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:36,151 INFO L225 Difference]: With dead ends: 6105 [2019-10-07 15:54:36,151 INFO L226 Difference]: Without dead ends: 4396 [2019-10-07 15:54:36,162 INFO L606 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-07 15:54:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-10-07 15:54:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4052. [2019-10-07 15:54:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2019-10-07 15:54:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 5124 transitions. [2019-10-07 15:54:36,491 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 5124 transitions. Word has length 102 [2019-10-07 15:54:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:36,491 INFO L462 AbstractCegarLoop]: Abstraction has 4052 states and 5124 transitions. [2019-10-07 15:54:36,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 5124 transitions. [2019-10-07 15:54:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 15:54:36,494 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:36,495 INFO L385 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-07 15:54:36,495 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 822083386, now seen corresponding path program 1 times [2019-10-07 15:54:36,495 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:36,495 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:36,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:36,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:36,663 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-07 15:54:36,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:36,663 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:36,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:36,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:36,664 INFO L87 Difference]: Start difference. First operand 4052 states and 5124 transitions. Second operand 9 states. [2019-10-07 15:54:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:37,965 INFO L93 Difference]: Finished difference Result 7670 states and 9786 transitions. [2019-10-07 15:54:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:37,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-07 15:54:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:37,986 INFO L225 Difference]: With dead ends: 7670 [2019-10-07 15:54:37,987 INFO L226 Difference]: Without dead ends: 4133 [2019-10-07 15:54:37,998 INFO L606 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-07 15:54:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-10-07 15:54:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 3639. [2019-10-07 15:54:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-07 15:54:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4579 transitions. [2019-10-07 15:54:38,228 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4579 transitions. Word has length 104 [2019-10-07 15:54:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:38,230 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 4579 transitions. [2019-10-07 15:54:38,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4579 transitions. [2019-10-07 15:54:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:38,232 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:38,233 INFO L385 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-07 15:54:38,233 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1741111612, now seen corresponding path program 1 times [2019-10-07 15:54:38,234 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:38,234 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:38,325 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-07 15:54:38,325 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,325 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:38,325 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:38,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:38,327 INFO L87 Difference]: Start difference. First operand 3639 states and 4579 transitions. Second operand 4 states. [2019-10-07 15:54:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:38,486 INFO L93 Difference]: Finished difference Result 6778 states and 8592 transitions. [2019-10-07 15:54:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:38,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-07 15:54:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:38,506 INFO L225 Difference]: With dead ends: 6778 [2019-10-07 15:54:38,507 INFO L226 Difference]: Without dead ends: 3581 [2019-10-07 15:54:38,516 INFO L606 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-07 15:54:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-10-07 15:54:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2019-10-07 15:54:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-10-07 15:54:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 4405 transitions. [2019-10-07 15:54:38,772 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 4405 transitions. Word has length 106 [2019-10-07 15:54:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:38,773 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 4405 transitions. [2019-10-07 15:54:38,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 4405 transitions. [2019-10-07 15:54:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:38,775 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:38,776 INFO L385 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-07 15:54:38,776 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash 317418295, now seen corresponding path program 1 times [2019-10-07 15:54:38,776 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:38,777 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,777 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,777 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:38,847 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-07 15:54:38,847 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,847 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:38,848 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:38,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:38,854 INFO L87 Difference]: Start difference. First operand 3581 states and 4405 transitions. Second operand 5 states. [2019-10-07 15:54:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:39,581 INFO L93 Difference]: Finished difference Result 10843 states and 13339 transitions. [2019-10-07 15:54:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:39,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-07 15:54:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:39,633 INFO L225 Difference]: With dead ends: 10843 [2019-10-07 15:54:39,634 INFO L226 Difference]: Without dead ends: 7777 [2019-10-07 15:54:39,653 INFO L606 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-07 15:54:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2019-10-07 15:54:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 6122. [2019-10-07 15:54:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6122 states. [2019-10-07 15:54:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 7525 transitions. [2019-10-07 15:54:40,130 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 7525 transitions. Word has length 106 [2019-10-07 15:54:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,131 INFO L462 AbstractCegarLoop]: Abstraction has 6122 states and 7525 transitions. [2019-10-07 15:54:40,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 7525 transitions. [2019-10-07 15:54:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:40,134 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,135 INFO L385 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-07 15:54:40,135 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1612477254, now seen corresponding path program 1 times [2019-10-07 15:54:40,135 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,136 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,201 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-07 15:54:40,201 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,202 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,202 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:40,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:40,203 INFO L87 Difference]: Start difference. First operand 6122 states and 7525 transitions. Second operand 5 states. [2019-10-07 15:54:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,798 INFO L93 Difference]: Finished difference Result 14100 states and 17318 transitions. [2019-10-07 15:54:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:40,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-07 15:54:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,836 INFO L225 Difference]: With dead ends: 14100 [2019-10-07 15:54:40,837 INFO L226 Difference]: Without dead ends: 8710 [2019-10-07 15:54:40,849 INFO L606 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-07 15:54:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-10-07 15:54:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 8358. [2019-10-07 15:54:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8358 states. [2019-10-07 15:54:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 10251 transitions. [2019-10-07 15:54:41,246 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 10251 transitions. Word has length 106 [2019-10-07 15:54:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,247 INFO L462 AbstractCegarLoop]: Abstraction has 8358 states and 10251 transitions. [2019-10-07 15:54:41,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 10251 transitions. [2019-10-07 15:54:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-07 15:54:41,252 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,252 INFO L385 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-07 15:54:41,252 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1928416921, now seen corresponding path program 1 times [2019-10-07 15:54:41,253 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,253 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,253 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,253 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,302 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-07 15:54:41,303 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,303 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,303 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:41,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:41,304 INFO L87 Difference]: Start difference. First operand 8358 states and 10251 transitions. Second operand 3 states. [2019-10-07 15:54:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,679 INFO L93 Difference]: Finished difference Result 15994 states and 19556 transitions. [2019-10-07 15:54:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:41,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-07 15:54:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,705 INFO L225 Difference]: With dead ends: 15994 [2019-10-07 15:54:41,705 INFO L226 Difference]: Without dead ends: 8397 [2019-10-07 15:54:41,722 INFO L606 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-07 15:54:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2019-10-07 15:54:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 8364. [2019-10-07 15:54:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8364 states. [2019-10-07 15:54:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8364 states to 8364 states and 10257 transitions. [2019-10-07 15:54:42,169 INFO L78 Accepts]: Start accepts. Automaton has 8364 states and 10257 transitions. Word has length 107 [2019-10-07 15:54:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,169 INFO L462 AbstractCegarLoop]: Abstraction has 8364 states and 10257 transitions. [2019-10-07 15:54:42,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8364 states and 10257 transitions. [2019-10-07 15:54:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 15:54:42,174 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,174 INFO L385 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-07 15:54:42,174 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2043218370, now seen corresponding path program 1 times [2019-10-07 15:54:42,175 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,175 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,175 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,175 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,342 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-07 15:54:42,342 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,342 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,343 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:42,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:42,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:42,344 INFO L87 Difference]: Start difference. First operand 8364 states and 10257 transitions. Second operand 9 states. [2019-10-07 15:54:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,875 INFO L93 Difference]: Finished difference Result 15918 states and 19435 transitions. [2019-10-07 15:54:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 15:54:43,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-07 15:54:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,903 INFO L225 Difference]: With dead ends: 15918 [2019-10-07 15:54:43,904 INFO L226 Difference]: Without dead ends: 7752 [2019-10-07 15:54:43,922 INFO L606 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-07 15:54:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2019-10-07 15:54:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7005. [2019-10-07 15:54:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7005 states. [2019-10-07 15:54:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 8523 transitions. [2019-10-07 15:54:44,284 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 8523 transitions. Word has length 108 [2019-10-07 15:54:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:44,285 INFO L462 AbstractCegarLoop]: Abstraction has 7005 states and 8523 transitions. [2019-10-07 15:54:44,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 8523 transitions. [2019-10-07 15:54:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-07 15:54:44,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:44,287 INFO L385 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-07 15:54:44,288 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1292914891, now seen corresponding path program 1 times [2019-10-07 15:54:44,288 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:44,288 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:44,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:44,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:44,337 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-07 15:54:44,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:44,338 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:44,338 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:44,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:44,339 INFO L87 Difference]: Start difference. First operand 7005 states and 8523 transitions. Second operand 3 states. [2019-10-07 15:54:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:45,115 INFO L93 Difference]: Finished difference Result 13744 states and 16706 transitions. [2019-10-07 15:54:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:45,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-07 15:54:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:45,141 INFO L225 Difference]: With dead ends: 13744 [2019-10-07 15:54:45,141 INFO L226 Difference]: Without dead ends: 7047 [2019-10-07 15:54:45,153 INFO L606 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-07 15:54:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2019-10-07 15:54:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 7011. [2019-10-07 15:54:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7011 states. [2019-10-07 15:54:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 8529 transitions. [2019-10-07 15:54:45,551 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 8529 transitions. Word has length 109 [2019-10-07 15:54:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:45,551 INFO L462 AbstractCegarLoop]: Abstraction has 7011 states and 8529 transitions. [2019-10-07 15:54:45,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 8529 transitions. [2019-10-07 15:54:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-07 15:54:45,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:45,554 INFO L385 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-07 15:54:45,554 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1009964240, now seen corresponding path program 1 times [2019-10-07 15:54:45,555 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:45,555 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:45,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:45,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:45,811 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-07 15:54:45,811 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:45,811 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:45,811 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 15:54:45,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 15:54:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 15:54:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:54:45,813 INFO L87 Difference]: Start difference. First operand 7011 states and 8529 transitions. Second operand 8 states. [2019-10-07 15:54:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:47,298 INFO L93 Difference]: Finished difference Result 13754 states and 16703 transitions. [2019-10-07 15:54:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 15:54:47,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-10-07 15:54:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:47,322 INFO L225 Difference]: With dead ends: 13754 [2019-10-07 15:54:47,322 INFO L226 Difference]: Without dead ends: 7049 [2019-10-07 15:54:47,336 INFO L606 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-07 15:54:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2019-10-07 15:54:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 6851. [2019-10-07 15:54:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6851 states. [2019-10-07 15:54:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 8319 transitions. [2019-10-07 15:54:47,712 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 8319 transitions. Word has length 109 [2019-10-07 15:54:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:47,713 INFO L462 AbstractCegarLoop]: Abstraction has 6851 states and 8319 transitions. [2019-10-07 15:54:47,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 15:54:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 8319 transitions. [2019-10-07 15:54:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 15:54:47,715 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:47,715 INFO L385 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, 1] [2019-10-07 15:54:47,716 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2035407738, now seen corresponding path program 1 times [2019-10-07 15:54:47,716 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:47,716 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:47,776 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-07 15:54:47,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,777 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:47,777 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:47,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:47,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:47,778 INFO L87 Difference]: Start difference. First operand 6851 states and 8319 transitions. Second operand 4 states. [2019-10-07 15:54:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:48,136 INFO L93 Difference]: Finished difference Result 13242 states and 16033 transitions. [2019-10-07 15:54:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:48,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-07 15:54:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:48,155 INFO L225 Difference]: With dead ends: 13242 [2019-10-07 15:54:48,155 INFO L226 Difference]: Without dead ends: 6695 [2019-10-07 15:54:48,165 INFO L606 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-07 15:54:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6695 states. [2019-10-07 15:54:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6695 to 6336. [2019-10-07 15:54:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6336 states. [2019-10-07 15:54:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 7675 transitions. [2019-10-07 15:54:48,526 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 7675 transitions. Word has length 110 [2019-10-07 15:54:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:48,527 INFO L462 AbstractCegarLoop]: Abstraction has 6336 states and 7675 transitions. [2019-10-07 15:54:48,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 7675 transitions. [2019-10-07 15:54:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 15:54:48,529 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:48,529 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:48,529 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash -845784574, now seen corresponding path program 1 times [2019-10-07 15:54:48,530 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:48,530 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:48,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:48,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 15:54:48,615 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:48,615 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:48,615 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:48,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:48,617 INFO L87 Difference]: Start difference. First operand 6336 states and 7675 transitions. Second operand 4 states. [2019-10-07 15:54:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:48,839 INFO L93 Difference]: Finished difference Result 12269 states and 14985 transitions. [2019-10-07 15:54:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:48,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-07 15:54:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:48,859 INFO L225 Difference]: With dead ends: 12269 [2019-10-07 15:54:48,859 INFO L226 Difference]: Without dead ends: 6216 [2019-10-07 15:54:48,870 INFO L606 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-07 15:54:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2019-10-07 15:54:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 5838. [2019-10-07 15:54:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5838 states. [2019-10-07 15:54:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 6835 transitions. [2019-10-07 15:54:49,214 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 6835 transitions. Word has length 122 [2019-10-07 15:54:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:49,214 INFO L462 AbstractCegarLoop]: Abstraction has 5838 states and 6835 transitions. [2019-10-07 15:54:49,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 6835 transitions. [2019-10-07 15:54:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:54:49,217 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:49,218 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:49,218 INFO L410 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -371490920, now seen corresponding path program 1 times [2019-10-07 15:54:49,219 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:49,219 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:49,219 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,219 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 15:54:49,322 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:49,322 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:49,323 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:49,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:49,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:49,324 INFO L87 Difference]: Start difference. First operand 5838 states and 6835 transitions. Second operand 4 states. [2019-10-07 15:54:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:49,639 INFO L93 Difference]: Finished difference Result 11235 states and 13191 transitions. [2019-10-07 15:54:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:49,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-07 15:54:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:49,656 INFO L225 Difference]: With dead ends: 11235 [2019-10-07 15:54:49,657 INFO L226 Difference]: Without dead ends: 5700 [2019-10-07 15:54:49,666 INFO L606 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-07 15:54:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-10-07 15:54:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5296. [2019-10-07 15:54:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-10-07 15:54:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 6026 transitions. [2019-10-07 15:54:49,950 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 6026 transitions. Word has length 138 [2019-10-07 15:54:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:49,951 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 6026 transitions. [2019-10-07 15:54:49,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 6026 transitions. [2019-10-07 15:54:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 15:54:49,954 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:49,955 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:49,955 INFO L410 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1627825050, now seen corresponding path program 1 times [2019-10-07 15:54:49,955 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:49,956 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:49,956 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,956 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 15:54:50,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:50,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:50,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 15:54:50,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 15:54:50,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 15:54:51,065 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:54:51,065 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-07 15:54:51,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:54:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:54:51,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:51,066 INFO L87 Difference]: Start difference. First operand 5296 states and 6026 transitions. Second operand 11 states. [2019-10-07 15:54:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:52,825 INFO L93 Difference]: Finished difference Result 11837 states and 13370 transitions. [2019-10-07 15:54:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:52,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2019-10-07 15:54:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:52,860 INFO L225 Difference]: With dead ends: 11837 [2019-10-07 15:54:52,860 INFO L226 Difference]: Without dead ends: 6776 [2019-10-07 15:54:52,871 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 15:54:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6776 states. [2019-10-07 15:54:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6776 to 4995. [2019-10-07 15:54:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-10-07 15:54:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 5616 transitions. [2019-10-07 15:54:53,245 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 5616 transitions. Word has length 150 [2019-10-07 15:54:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:53,246 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 5616 transitions. [2019-10-07 15:54:53,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:54:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 5616 transitions. [2019-10-07 15:54:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 15:54:53,250 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:53,250 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:53,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:53,455 INFO L410 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash 265193334, now seen corresponding path program 1 times [2019-10-07 15:54:53,456 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:53,456 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:53,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:53,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 15:54:53,692 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:53,692 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 15:54:54,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:54,195 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-07 15:54:54,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:54:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-07 15:54:54,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:54,918 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:55,076 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:56,952 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8191 disjunctions. This might take some time... [2019-10-07 15:55:00,767 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 8191 disjunctions.