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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:10,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:10,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:10,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:10,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:10,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:10,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:10,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:10,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:10,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:10,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:10,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:10,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:10,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:10,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:10,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:10,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:10,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:10,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:10,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:10,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:10,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:10,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:10,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:10,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:10,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:10,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:10,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:10,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:10,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:10,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:10,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:10,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:10,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:10,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:10,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:10,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:10,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:10,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:10,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:10,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:10,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:27:10,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:10,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:10,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:10,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:10,434 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:10,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:10,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:10,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:10,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:10,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:10,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:10,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:10,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:10,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:10,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:10,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:10,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:10,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:10,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:10,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:10,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:10,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:10,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:10,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:10,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:10,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:10,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:10,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:10,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:27:10,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:10,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:10,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:10,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:10,721 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:10,721 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.BOUNDED-10.pals.c [2019-10-15 03:27:10,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55060293c/c75546f0a33a4c9fb7f29ac9da78306f/FLAGed75f9b84 [2019-10-15 03:27:11,360 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:11,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:11,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55060293c/c75546f0a33a4c9fb7f29ac9da78306f/FLAGed75f9b84 [2019-10-15 03:27:11,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55060293c/c75546f0a33a4c9fb7f29ac9da78306f [2019-10-15 03:27:11,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:11,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:11,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:11,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:11,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:11,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9ca86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:11, skipping insertion in model container [2019-10-15 03:27:11,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:11" (1/1) ... [2019-10-15 03:27:11,634 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:11,698 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:12,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:12,076 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:12,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:12,171 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:12,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12 WrapperNode [2019-10-15 03:27:12,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:12,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:12,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:12,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:12,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... [2019-10-15 03:27:12,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:12,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:12,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:12,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:12,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:12,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:12,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:12,301 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 03:27:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 03:27:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 03:27:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 03:27:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 03:27:12,303 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 03:27:12,306 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:12,307 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:12,308 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:12,308 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:12,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:12,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:12,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:13,592 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:13,593 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:27:13,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:13 BoogieIcfgContainer [2019-10-15 03:27:13,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:13,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:13,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:13,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:13,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:11" (1/3) ... [2019-10-15 03:27:13,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c60468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:13, skipping insertion in model container [2019-10-15 03:27:13,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:12" (2/3) ... [2019-10-15 03:27:13,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c60468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:13, skipping insertion in model container [2019-10-15 03:27:13,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:13" (3/3) ... [2019-10-15 03:27:13,605 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:13,615 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:13,623 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:13,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:13,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:13,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:13,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:13,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:13,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:13,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:13,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:13,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-10-15 03:27:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:27:13,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:13,739 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1264389532, now seen corresponding path program 1 times [2019-10-15 03:27:13,759 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111674208] [2019-10-15 03:27:13,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:14,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111674208] [2019-10-15 03:27:14,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686711061] [2019-10-15 03:27:14,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,290 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2019-10-15 03:27:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,440 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2019-10-15 03:27:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-15 03:27:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,455 INFO L225 Difference]: With dead ends: 365 [2019-10-15 03:27:14,455 INFO L226 Difference]: Without dead ends: 186 [2019-10-15 03:27:14,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-15 03:27:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-15 03:27:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-15 03:27:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2019-10-15 03:27:14,528 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 44 [2019-10-15 03:27:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,529 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-10-15 03:27:14,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2019-10-15 03:27:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:27:14,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:14,533 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash 118430116, now seen corresponding path program 1 times [2019-10-15 03:27:14,533 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419766945] [2019-10-15 03:27:14,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:14,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419766945] [2019-10-15 03:27:14,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:14,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195097774] [2019-10-15 03:27:14,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:14,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:14,773 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 7 states. [2019-10-15 03:27:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:15,934 INFO L93 Difference]: Finished difference Result 418 states and 592 transitions. [2019-10-15 03:27:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:27:15,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-15 03:27:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:15,940 INFO L225 Difference]: With dead ends: 418 [2019-10-15 03:27:15,941 INFO L226 Difference]: Without dead ends: 241 [2019-10-15 03:27:15,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-15 03:27:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-10-15 03:27:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-15 03:27:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-15 03:27:15,990 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 59 [2019-10-15 03:27:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-15 03:27:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-15 03:27:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:27:15,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:15,994 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1173692886, now seen corresponding path program 1 times [2019-10-15 03:27:15,995 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832071478] [2019-10-15 03:27:15,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:16,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832071478] [2019-10-15 03:27:16,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:16,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:16,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832508552] [2019-10-15 03:27:16,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:16,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:16,152 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 7 states. [2019-10-15 03:27:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:17,016 INFO L93 Difference]: Finished difference Result 424 states and 600 transitions. [2019-10-15 03:27:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:27:17,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-15 03:27:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:17,021 INFO L225 Difference]: With dead ends: 424 [2019-10-15 03:27:17,021 INFO L226 Difference]: Without dead ends: 244 [2019-10-15 03:27:17,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-15 03:27:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2019-10-15 03:27:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-15 03:27:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-15 03:27:17,047 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 60 [2019-10-15 03:27:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:17,049 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-15 03:27:17,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-15 03:27:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:27:17,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:17,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:17,052 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash -245947725, now seen corresponding path program 1 times [2019-10-15 03:27:17,053 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:17,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259847871] [2019-10-15 03:27:17,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:17,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259847871] [2019-10-15 03:27:17,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:17,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838488154] [2019-10-15 03:27:17,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:17,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:17,179 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 5 states. [2019-10-15 03:27:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:17,279 INFO L93 Difference]: Finished difference Result 830 states and 1168 transitions. [2019-10-15 03:27:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:17,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-15 03:27:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:17,286 INFO L225 Difference]: With dead ends: 830 [2019-10-15 03:27:17,286 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 03:27:17,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 03:27:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 456. [2019-10-15 03:27:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-15 03:27:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 636 transitions. [2019-10-15 03:27:17,336 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 636 transitions. Word has length 62 [2019-10-15 03:27:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 636 transitions. [2019-10-15 03:27:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 636 transitions. [2019-10-15 03:27:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 03:27:17,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:17,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:17,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1570515984, now seen corresponding path program 1 times [2019-10-15 03:27:17,341 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:17,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940280995] [2019-10-15 03:27:17,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:17,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940280995] [2019-10-15 03:27:17,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:17,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146180243] [2019-10-15 03:27:17,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:17,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:17,438 INFO L87 Difference]: Start difference. First operand 456 states and 636 transitions. Second operand 4 states. [2019-10-15 03:27:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:17,520 INFO L93 Difference]: Finished difference Result 832 states and 1175 transitions. [2019-10-15 03:27:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:17,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-15 03:27:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:17,526 INFO L225 Difference]: With dead ends: 832 [2019-10-15 03:27:17,526 INFO L226 Difference]: Without dead ends: 466 [2019-10-15 03:27:17,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-15 03:27:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-15 03:27:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 03:27:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 644 transitions. [2019-10-15 03:27:17,579 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 644 transitions. Word has length 64 [2019-10-15 03:27:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 644 transitions. [2019-10-15 03:27:17,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 644 transitions. [2019-10-15 03:27:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:27:17,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:17,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:17,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1373912432, now seen corresponding path program 1 times [2019-10-15 03:27:17,588 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:17,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420576225] [2019-10-15 03:27:17,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:17,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420576225] [2019-10-15 03:27:17,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:17,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807075176] [2019-10-15 03:27:17,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:17,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:17,687 INFO L87 Difference]: Start difference. First operand 466 states and 644 transitions. Second operand 4 states. [2019-10-15 03:27:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:17,753 INFO L93 Difference]: Finished difference Result 852 states and 1197 transitions. [2019-10-15 03:27:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:17,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-15 03:27:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:17,759 INFO L225 Difference]: With dead ends: 852 [2019-10-15 03:27:17,759 INFO L226 Difference]: Without dead ends: 476 [2019-10-15 03:27:17,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-15 03:27:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-15 03:27:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-15 03:27:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 652 transitions. [2019-10-15 03:27:17,793 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 652 transitions. Word has length 72 [2019-10-15 03:27:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:17,795 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 652 transitions. [2019-10-15 03:27:17,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 652 transitions. [2019-10-15 03:27:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:27:17,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:17,798 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:17,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1336802682, now seen corresponding path program 1 times [2019-10-15 03:27:17,799 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:17,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463880535] [2019-10-15 03:27:17,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:17,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463880535] [2019-10-15 03:27:17,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:17,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265970604] [2019-10-15 03:27:17,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:17,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:17,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:17,953 INFO L87 Difference]: Start difference. First operand 476 states and 652 transitions. Second operand 4 states. [2019-10-15 03:27:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,027 INFO L93 Difference]: Finished difference Result 870 states and 1205 transitions. [2019-10-15 03:27:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:18,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-15 03:27:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,032 INFO L225 Difference]: With dead ends: 870 [2019-10-15 03:27:18,032 INFO L226 Difference]: Without dead ends: 484 [2019-10-15 03:27:18,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-10-15 03:27:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-10-15 03:27:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-15 03:27:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 658 transitions. [2019-10-15 03:27:18,086 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 658 transitions. Word has length 80 [2019-10-15 03:27:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,087 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 658 transitions. [2019-10-15 03:27:18,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 658 transitions. [2019-10-15 03:27:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:27:18,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -392875626, now seen corresponding path program 1 times [2019-10-15 03:27:18,091 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464676863] [2019-10-15 03:27:18,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:18,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464676863] [2019-10-15 03:27:18,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:18,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663697391] [2019-10-15 03:27:18,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:18,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:18,228 INFO L87 Difference]: Start difference. First operand 484 states and 658 transitions. Second operand 4 states. [2019-10-15 03:27:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,295 INFO L93 Difference]: Finished difference Result 888 states and 1225 transitions. [2019-10-15 03:27:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:18,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-15 03:27:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,300 INFO L225 Difference]: With dead ends: 888 [2019-10-15 03:27:18,300 INFO L226 Difference]: Without dead ends: 494 [2019-10-15 03:27:18,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-15 03:27:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-15 03:27:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-15 03:27:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 666 transitions. [2019-10-15 03:27:18,378 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 666 transitions. Word has length 80 [2019-10-15 03:27:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,379 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 666 transitions. [2019-10-15 03:27:18,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 666 transitions. [2019-10-15 03:27:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 03:27:18,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,385 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 871987098, now seen corresponding path program 1 times [2019-10-15 03:27:18,385 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246153586] [2019-10-15 03:27:18,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:27:18,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246153586] [2019-10-15 03:27:18,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:18,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188607493] [2019-10-15 03:27:18,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:18,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:18,514 INFO L87 Difference]: Start difference. First operand 494 states and 666 transitions. Second operand 4 states. [2019-10-15 03:27:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,571 INFO L93 Difference]: Finished difference Result 910 states and 1239 transitions. [2019-10-15 03:27:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:18,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 03:27:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,577 INFO L225 Difference]: With dead ends: 910 [2019-10-15 03:27:18,578 INFO L226 Difference]: Without dead ends: 506 [2019-10-15 03:27:18,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-15 03:27:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-10-15 03:27:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-15 03:27:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 676 transitions. [2019-10-15 03:27:18,616 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 676 transitions. Word has length 88 [2019-10-15 03:27:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,618 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 676 transitions. [2019-10-15 03:27:18,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 676 transitions. [2019-10-15 03:27:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 03:27:18,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,621 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1679018407, now seen corresponding path program 1 times [2019-10-15 03:27:18,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737305125] [2019-10-15 03:27:18,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:27:18,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737305125] [2019-10-15 03:27:18,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:18,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036583324] [2019-10-15 03:27:18,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:18,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:18,964 INFO L87 Difference]: Start difference. First operand 506 states and 676 transitions. Second operand 12 states. [2019-10-15 03:27:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:21,963 INFO L93 Difference]: Finished difference Result 1348 states and 1779 transitions. [2019-10-15 03:27:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:21,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-15 03:27:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:21,969 INFO L225 Difference]: With dead ends: 1348 [2019-10-15 03:27:21,970 INFO L226 Difference]: Without dead ends: 926 [2019-10-15 03:27:21,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-15 03:27:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-10-15 03:27:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 856. [2019-10-15 03:27:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-15 03:27:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1120 transitions. [2019-10-15 03:27:22,029 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1120 transitions. Word has length 93 [2019-10-15 03:27:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,030 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1120 transitions. [2019-10-15 03:27:22,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1120 transitions. [2019-10-15 03:27:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 03:27:22,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,032 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:22,032 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 43626938, now seen corresponding path program 1 times [2019-10-15 03:27:22,033 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140287818] [2019-10-15 03:27:22,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:27:22,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140287818] [2019-10-15 03:27:22,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313896655] [2019-10-15 03:27:22,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,110 INFO L87 Difference]: Start difference. First operand 856 states and 1120 transitions. Second operand 4 states. [2019-10-15 03:27:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,186 INFO L93 Difference]: Finished difference Result 1566 states and 2059 transitions. [2019-10-15 03:27:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:22,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-15 03:27:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,194 INFO L225 Difference]: With dead ends: 1566 [2019-10-15 03:27:22,195 INFO L226 Difference]: Without dead ends: 864 [2019-10-15 03:27:22,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-10-15 03:27:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-10-15 03:27:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-15 03:27:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1116 transitions. [2019-10-15 03:27:22,271 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1116 transitions. Word has length 95 [2019-10-15 03:27:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,271 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1116 transitions. [2019-10-15 03:27:22,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1116 transitions. [2019-10-15 03:27:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 03:27:22,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,275 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:22,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 549476847, now seen corresponding path program 1 times [2019-10-15 03:27:22,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995055641] [2019-10-15 03:27:22,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:22,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995055641] [2019-10-15 03:27:22,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682249950] [2019-10-15 03:27:22,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,472 INFO L87 Difference]: Start difference. First operand 864 states and 1116 transitions. Second operand 4 states. [2019-10-15 03:27:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,550 INFO L93 Difference]: Finished difference Result 1532 states and 1985 transitions. [2019-10-15 03:27:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:22,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-15 03:27:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,556 INFO L225 Difference]: With dead ends: 1532 [2019-10-15 03:27:22,556 INFO L226 Difference]: Without dead ends: 856 [2019-10-15 03:27:22,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-15 03:27:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2019-10-15 03:27:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-15 03:27:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1092 transitions. [2019-10-15 03:27:22,635 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1092 transitions. Word has length 97 [2019-10-15 03:27:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,635 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1092 transitions. [2019-10-15 03:27:22,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1092 transitions. [2019-10-15 03:27:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:27:22,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,639 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:22,639 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1263786637, now seen corresponding path program 1 times [2019-10-15 03:27:22,640 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535915243] [2019-10-15 03:27:22,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:22,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535915243] [2019-10-15 03:27:22,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:22,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820304626] [2019-10-15 03:27:22,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:22,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:22,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:22,793 INFO L87 Difference]: Start difference. First operand 856 states and 1092 transitions. Second operand 7 states. [2019-10-15 03:27:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,902 INFO L93 Difference]: Finished difference Result 916 states and 1178 transitions. [2019-10-15 03:27:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:27:22,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 03:27:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,908 INFO L225 Difference]: With dead ends: 916 [2019-10-15 03:27:22,908 INFO L226 Difference]: Without dead ends: 914 [2019-10-15 03:27:22,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-15 03:27:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 876. [2019-10-15 03:27:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-15 03:27:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1114 transitions. [2019-10-15 03:27:22,969 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1114 transitions. Word has length 96 [2019-10-15 03:27:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,970 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1114 transitions. [2019-10-15 03:27:22,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1114 transitions. [2019-10-15 03:27:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 03:27:22,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,972 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:22,972 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 199062795, now seen corresponding path program 1 times [2019-10-15 03:27:22,973 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710349062] [2019-10-15 03:27:22,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:23,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710349062] [2019-10-15 03:27:23,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:23,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311899910] [2019-10-15 03:27:23,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:23,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:23,221 INFO L87 Difference]: Start difference. First operand 876 states and 1114 transitions. Second operand 12 states. [2019-10-15 03:27:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:26,859 INFO L93 Difference]: Finished difference Result 2482 states and 3116 transitions. [2019-10-15 03:27:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:26,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-15 03:27:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:26,875 INFO L225 Difference]: With dead ends: 2482 [2019-10-15 03:27:26,875 INFO L226 Difference]: Without dead ends: 1794 [2019-10-15 03:27:26,881 INFO L600 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-15 03:27:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-10-15 03:27:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1401. [2019-10-15 03:27:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-15 03:27:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1768 transitions. [2019-10-15 03:27:27,013 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1768 transitions. Word has length 101 [2019-10-15 03:27:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:27,013 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1768 transitions. [2019-10-15 03:27:27,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1768 transitions. [2019-10-15 03:27:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:27,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:27,018 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:27,018 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:27,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1539640288, now seen corresponding path program 1 times [2019-10-15 03:27:27,019 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:27,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095307131] [2019-10-15 03:27:27,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:27:27,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095307131] [2019-10-15 03:27:27,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:27,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:27,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577609584] [2019-10-15 03:27:27,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:27,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:27,313 INFO L87 Difference]: Start difference. First operand 1401 states and 1768 transitions. Second operand 9 states. [2019-10-15 03:27:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:28,588 INFO L93 Difference]: Finished difference Result 3418 states and 4363 transitions. [2019-10-15 03:27:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:28,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-15 03:27:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:28,607 INFO L225 Difference]: With dead ends: 3418 [2019-10-15 03:27:28,607 INFO L226 Difference]: Without dead ends: 2224 [2019-10-15 03:27:28,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-10-15 03:27:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1963. [2019-10-15 03:27:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-10-15 03:27:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2470 transitions. [2019-10-15 03:27:28,808 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2470 transitions. Word has length 102 [2019-10-15 03:27:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:28,809 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2470 transitions. [2019-10-15 03:27:28,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2470 transitions. [2019-10-15 03:27:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:28,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:28,812 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:28,812 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 823112389, now seen corresponding path program 1 times [2019-10-15 03:27:28,813 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:28,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641441980] [2019-10-15 03:27:28,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:28,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641441980] [2019-10-15 03:27:28,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:28,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:28,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326795532] [2019-10-15 03:27:28,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:28,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:28,950 INFO L87 Difference]: Start difference. First operand 1963 states and 2470 transitions. Second operand 5 states. [2019-10-15 03:27:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:29,449 INFO L93 Difference]: Finished difference Result 6113 states and 7766 transitions. [2019-10-15 03:27:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:29,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:29,475 INFO L225 Difference]: With dead ends: 6113 [2019-10-15 03:27:29,475 INFO L226 Difference]: Without dead ends: 4402 [2019-10-15 03:27:29,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-10-15 03:27:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4056. [2019-10-15 03:27:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4056 states. [2019-10-15 03:27:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5128 transitions. [2019-10-15 03:27:29,821 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5128 transitions. Word has length 102 [2019-10-15 03:27:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:29,822 INFO L462 AbstractCegarLoop]: Abstraction has 4056 states and 5128 transitions. [2019-10-15 03:27:29,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5128 transitions. [2019-10-15 03:27:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:27:29,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:29,826 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:29,826 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash -637002213, now seen corresponding path program 1 times [2019-10-15 03:27:29,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:29,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66696296] [2019-10-15 03:27:29,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:27:30,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66696296] [2019-10-15 03:27:30,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:30,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:30,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892309099] [2019-10-15 03:27:30,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:30,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:30,087 INFO L87 Difference]: Start difference. First operand 4056 states and 5128 transitions. Second operand 9 states. [2019-10-15 03:27:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:31,546 INFO L93 Difference]: Finished difference Result 7974 states and 10275 transitions. [2019-10-15 03:27:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:27:31,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-15 03:27:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:31,573 INFO L225 Difference]: With dead ends: 7974 [2019-10-15 03:27:31,573 INFO L226 Difference]: Without dead ends: 4363 [2019-10-15 03:27:31,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:27:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2019-10-15 03:27:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3801. [2019-10-15 03:27:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2019-10-15 03:27:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 4825 transitions. [2019-10-15 03:27:31,870 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 4825 transitions. Word has length 104 [2019-10-15 03:27:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 3801 states and 4825 transitions. [2019-10-15 03:27:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 4825 transitions. [2019-10-15 03:27:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:31,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:31,877 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:31,877 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -265673379, now seen corresponding path program 1 times [2019-10-15 03:27:31,878 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:31,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911963153] [2019-10-15 03:27:31,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 03:27:31,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911963153] [2019-10-15 03:27:31,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:31,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:31,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049461971] [2019-10-15 03:27:31,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:31,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:31,963 INFO L87 Difference]: Start difference. First operand 3801 states and 4825 transitions. Second operand 4 states. [2019-10-15 03:27:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:32,222 INFO L93 Difference]: Finished difference Result 7086 states and 9072 transitions. [2019-10-15 03:27:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:32,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 03:27:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:32,248 INFO L225 Difference]: With dead ends: 7086 [2019-10-15 03:27:32,249 INFO L226 Difference]: Without dead ends: 3743 [2019-10-15 03:27:32,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2019-10-15 03:27:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3743. [2019-10-15 03:27:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-10-15 03:27:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 4651 transitions. [2019-10-15 03:27:32,501 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 4651 transitions. Word has length 106 [2019-10-15 03:27:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:32,501 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 4651 transitions. [2019-10-15 03:27:32,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 4651 transitions. [2019-10-15 03:27:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:32,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:32,505 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:32,505 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1486704120, now seen corresponding path program 1 times [2019-10-15 03:27:32,506 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:32,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047094435] [2019-10-15 03:27:32,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:32,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:32,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047094435] [2019-10-15 03:27:32,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:32,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:32,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828831982] [2019-10-15 03:27:32,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:32,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:32,583 INFO L87 Difference]: Start difference. First operand 3743 states and 4651 transitions. Second operand 5 states. [2019-10-15 03:27:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:33,187 INFO L93 Difference]: Finished difference Result 11140 states and 13786 transitions. [2019-10-15 03:27:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:33,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 03:27:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:33,248 INFO L225 Difference]: With dead ends: 11140 [2019-10-15 03:27:33,248 INFO L226 Difference]: Without dead ends: 7947 [2019-10-15 03:27:33,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2019-10-15 03:27:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6284. [2019-10-15 03:27:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6284 states. [2019-10-15 03:27:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 7766 transitions. [2019-10-15 03:27:33,764 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 7766 transitions. Word has length 106 [2019-10-15 03:27:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:33,764 INFO L462 AbstractCegarLoop]: Abstraction has 6284 states and 7766 transitions. [2019-10-15 03:27:33,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 7766 transitions. [2019-10-15 03:27:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:33,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:33,769 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:33,769 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1288049177, now seen corresponding path program 1 times [2019-10-15 03:27:33,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:33,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187869000] [2019-10-15 03:27:33,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:33,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187869000] [2019-10-15 03:27:33,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:33,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:33,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159183226] [2019-10-15 03:27:33,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:33,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:33,854 INFO L87 Difference]: Start difference. First operand 6284 states and 7766 transitions. Second operand 5 states. [2019-10-15 03:27:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:34,554 INFO L93 Difference]: Finished difference Result 14236 states and 17506 transitions. [2019-10-15 03:27:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:34,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 03:27:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:34,592 INFO L225 Difference]: With dead ends: 14236 [2019-10-15 03:27:34,593 INFO L226 Difference]: Without dead ends: 8719 [2019-10-15 03:27:34,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-10-15 03:27:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 8363. [2019-10-15 03:27:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8363 states. [2019-10-15 03:27:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8363 states to 8363 states and 10244 transitions. [2019-10-15 03:27:35,064 INFO L78 Accepts]: Start accepts. Automaton has 8363 states and 10244 transitions. Word has length 106 [2019-10-15 03:27:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:35,065 INFO L462 AbstractCegarLoop]: Abstraction has 8363 states and 10244 transitions. [2019-10-15 03:27:35,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8363 states and 10244 transitions. [2019-10-15 03:27:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 03:27:35,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:35,070 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:35,071 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2008197316, now seen corresponding path program 1 times [2019-10-15 03:27:35,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:35,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297065766] [2019-10-15 03:27:35,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:35,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297065766] [2019-10-15 03:27:35,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:35,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:35,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679474602] [2019-10-15 03:27:35,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:35,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:35,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:35,125 INFO L87 Difference]: Start difference. First operand 8363 states and 10244 transitions. Second operand 3 states. [2019-10-15 03:27:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:35,582 INFO L93 Difference]: Finished difference Result 16004 states and 19546 transitions. [2019-10-15 03:27:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:35,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-15 03:27:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:35,618 INFO L225 Difference]: With dead ends: 16004 [2019-10-15 03:27:35,618 INFO L226 Difference]: Without dead ends: 8402 [2019-10-15 03:27:35,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2019-10-15 03:27:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 8369. [2019-10-15 03:27:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-10-15 03:27:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 10250 transitions. [2019-10-15 03:27:36,104 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 10250 transitions. Word has length 107 [2019-10-15 03:27:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:36,105 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 10250 transitions. [2019-10-15 03:27:36,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 10250 transitions. [2019-10-15 03:27:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 03:27:36,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:36,110 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:36,110 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293821, now seen corresponding path program 1 times [2019-10-15 03:27:36,111 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:36,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958097505] [2019-10-15 03:27:36,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:36,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958097505] [2019-10-15 03:27:36,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:36,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:36,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617886320] [2019-10-15 03:27:36,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:36,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:36,317 INFO L87 Difference]: Start difference. First operand 8369 states and 10250 transitions. Second operand 9 states. [2019-10-15 03:27:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:37,842 INFO L93 Difference]: Finished difference Result 15928 states and 19425 transitions. [2019-10-15 03:27:37,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:27:37,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-15 03:27:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:37,878 INFO L225 Difference]: With dead ends: 15928 [2019-10-15 03:27:37,878 INFO L226 Difference]: Without dead ends: 7757 [2019-10-15 03:27:37,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:27:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2019-10-15 03:27:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 7010. [2019-10-15 03:27:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-10-15 03:27:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 8520 transitions. [2019-10-15 03:27:38,383 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 8520 transitions. Word has length 108 [2019-10-15 03:27:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:38,384 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 8520 transitions. [2019-10-15 03:27:38,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 8520 transitions. [2019-10-15 03:27:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 03:27:38,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:38,387 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:38,387 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash -114490251, now seen corresponding path program 1 times [2019-10-15 03:27:38,388 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:38,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027100087] [2019-10-15 03:27:38,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:38,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027100087] [2019-10-15 03:27:38,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:38,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:38,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313862874] [2019-10-15 03:27:38,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:38,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:38,442 INFO L87 Difference]: Start difference. First operand 7010 states and 8520 transitions. Second operand 3 states. [2019-10-15 03:27:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:38,738 INFO L93 Difference]: Finished difference Result 13754 states and 16701 transitions. [2019-10-15 03:27:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:38,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-15 03:27:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:38,763 INFO L225 Difference]: With dead ends: 13754 [2019-10-15 03:27:38,764 INFO L226 Difference]: Without dead ends: 7052 [2019-10-15 03:27:38,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2019-10-15 03:27:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 7016. [2019-10-15 03:27:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-15 03:27:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8526 transitions. [2019-10-15 03:27:39,226 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8526 transitions. Word has length 109 [2019-10-15 03:27:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:39,226 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 8526 transitions. [2019-10-15 03:27:39,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8526 transitions. [2019-10-15 03:27:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 03:27:39,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:39,229 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:39,230 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 168460400, now seen corresponding path program 1 times [2019-10-15 03:27:39,230 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:39,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341495243] [2019-10-15 03:27:39,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:39,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:39,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:39,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341495243] [2019-10-15 03:27:39,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:39,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:39,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681798247] [2019-10-15 03:27:39,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:39,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:39,475 INFO L87 Difference]: Start difference. First operand 7016 states and 8526 transitions. Second operand 9 states. [2019-10-15 03:27:40,073 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-10-15 03:27:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:41,334 INFO L93 Difference]: Finished difference Result 13764 states and 16698 transitions. [2019-10-15 03:27:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:27:41,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-10-15 03:27:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:41,354 INFO L225 Difference]: With dead ends: 13764 [2019-10-15 03:27:41,354 INFO L226 Difference]: Without dead ends: 7054 [2019-10-15 03:27:41,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:27:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-10-15 03:27:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6852. [2019-10-15 03:27:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2019-10-15 03:27:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 8312 transitions. [2019-10-15 03:27:41,745 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 8312 transitions. Word has length 109 [2019-10-15 03:27:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:41,746 INFO L462 AbstractCegarLoop]: Abstraction has 6852 states and 8312 transitions. [2019-10-15 03:27:41,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 8312 transitions. [2019-10-15 03:27:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 03:27:41,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:41,749 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:41,749 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash -837998841, now seen corresponding path program 1 times [2019-10-15 03:27:41,750 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:41,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857448530] [2019-10-15 03:27:41,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:41,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:41,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:41,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857448530] [2019-10-15 03:27:41,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:41,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:41,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119148381] [2019-10-15 03:27:41,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:41,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:41,863 INFO L87 Difference]: Start difference. First operand 6852 states and 8312 transitions. Second operand 4 states.