java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:08,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:08,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:08,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:08,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:08,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:08,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:08,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:08,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:08,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:08,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:08,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:08,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:08,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:08,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:08,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:08,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:08,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:08,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:08,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:08,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:08,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:08,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:08,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:08,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:08,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:08,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:08,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:08,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:08,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:08,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:08,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:08,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:08,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:08,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:08,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:08,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:08,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:08,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:08,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:08,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:08,976 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:08,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:08,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:09,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:09,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:09,002 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:09,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:09,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:09,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:09,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:09,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:09,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:09,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:09,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:09,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:09,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:09,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:09,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:09,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:09,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:09,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:09,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:09,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:09,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:09,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:09,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:09,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:09,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:09,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:09,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:27:09,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:09,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:09,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:09,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:09,339 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:09,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:09,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4402b08f/62f550891b6748af873b0ea4349440a8/FLAGfbbd6017b [2019-10-15 03:27:09,895 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:09,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:09,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4402b08f/62f550891b6748af873b0ea4349440a8/FLAGfbbd6017b [2019-10-15 03:27:10,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4402b08f/62f550891b6748af873b0ea4349440a8 [2019-10-15 03:27:10,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:10,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:10,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:10,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:10,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:10,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:10" (1/1) ... [2019-10-15 03:27:10,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a48b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:10, skipping insertion in model container [2019-10-15 03:27:10,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:10" (1/1) ... [2019-10-15 03:27:10,276 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:10,332 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:10,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:10,762 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:10,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:10,878 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:10,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:10 WrapperNode [2019-10-15 03:27:10,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:10,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:10,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:10,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:10,890 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:10" (1/1) ... [2019-10-15 03:27:10,890 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:10" (1/1) ... [2019-10-15 03:27:10,902 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:10" (1/1) ... [2019-10-15 03:27:10,903 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:10" (1/1) ... [2019-10-15 03:27:10,921 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:10" (1/1) ... [2019-10-15 03:27:10,935 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:10" (1/1) ... [2019-10-15 03:27:10,939 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:10" (1/1) ... [2019-10-15 03:27:10,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:10,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:10,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:10,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:10,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 03:27:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 03:27:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 03:27:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 03:27:11,007 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 03:27:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 03:27:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 03:27:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 03:27:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 03:27:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 03:27:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:11,013 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:11,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:11,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:11,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 03:27:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 03:27:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 03:27:11,015 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 03:27:11,016 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 03:27:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 03:27:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 03:27:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 03:27:11,017 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 03:27:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:12,415 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:12,415 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:27:12,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:12 BoogieIcfgContainer [2019-10-15 03:27:12,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:12,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:12,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:12,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:12,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:10" (1/3) ... [2019-10-15 03:27:12,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a78d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:12, skipping insertion in model container [2019-10-15 03:27:12,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:10" (2/3) ... [2019-10-15 03:27:12,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a78d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:12, skipping insertion in model container [2019-10-15 03:27:12,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:12" (3/3) ... [2019-10-15 03:27:12,425 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:12,436 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:12,445 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:12,457 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:12,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:12,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:12,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:12,486 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:12,487 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:12,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:12,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:12,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-10-15 03:27:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:27:12,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:12,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:12,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -625438079, now seen corresponding path program 1 times [2019-10-15 03:27:12,540 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:12,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195035124] [2019-10-15 03:27:12,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:12,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:12,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:13,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195035124] [2019-10-15 03:27:13,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:13,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:13,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126034410] [2019-10-15 03:27:13,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:13,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:13,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:13,130 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 4 states. [2019-10-15 03:27:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:13,270 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2019-10-15 03:27:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:13,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-15 03:27:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:13,292 INFO L225 Difference]: With dead ends: 355 [2019-10-15 03:27:13,293 INFO L226 Difference]: Without dead ends: 181 [2019-10-15 03:27:13,307 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:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-15 03:27:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-10-15 03:27:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-15 03:27:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2019-10-15 03:27:13,382 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 44 [2019-10-15 03:27:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:13,383 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2019-10-15 03:27:13,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2019-10-15 03:27:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:13,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:13,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 478066743, now seen corresponding path program 1 times [2019-10-15 03:27:13,387 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731754526] [2019-10-15 03:27:13,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:13,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731754526] [2019-10-15 03:27:13,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:13,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:13,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607669724] [2019-10-15 03:27:13,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:13,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:13,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:13,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:13,555 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 5 states. [2019-10-15 03:27:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:13,725 INFO L93 Difference]: Finished difference Result 693 states and 980 transitions. [2019-10-15 03:27:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:13,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-15 03:27:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:13,735 INFO L225 Difference]: With dead ends: 693 [2019-10-15 03:27:13,736 INFO L226 Difference]: Without dead ends: 503 [2019-10-15 03:27:13,738 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:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-15 03:27:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 359. [2019-10-15 03:27:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-15 03:27:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 506 transitions. [2019-10-15 03:27:13,856 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 506 transitions. Word has length 58 [2019-10-15 03:27:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:13,856 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 506 transitions. [2019-10-15 03:27:13,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2019-10-15 03:27:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:27:13,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,860 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:13,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -226555182, now seen corresponding path program 1 times [2019-10-15 03:27:13,861 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865703817] [2019-10-15 03:27:13,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,005 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,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865703817] [2019-10-15 03:27:14,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718559381] [2019-10-15 03:27:14,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,007 INFO L87 Difference]: Start difference. First operand 359 states and 506 transitions. Second operand 4 states. [2019-10-15 03:27:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,062 INFO L93 Difference]: Finished difference Result 719 states and 1019 transitions. [2019-10-15 03:27:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-15 03:27:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,067 INFO L225 Difference]: With dead ends: 719 [2019-10-15 03:27:14,067 INFO L226 Difference]: Without dead ends: 369 [2019-10-15 03:27:14,069 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:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-15 03:27:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2019-10-15 03:27:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-15 03:27:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 514 transitions. [2019-10-15 03:27:14,103 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 514 transitions. Word has length 60 [2019-10-15 03:27:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,104 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 514 transitions. [2019-10-15 03:27:14,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 514 transitions. [2019-10-15 03:27:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 03:27:14,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:14,107 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash -922435534, now seen corresponding path program 1 times [2019-10-15 03:27:14,108 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191434400] [2019-10-15 03:27:14,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,213 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,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191434400] [2019-10-15 03:27:14,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527391776] [2019-10-15 03:27:14,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,217 INFO L87 Difference]: Start difference. First operand 369 states and 514 transitions. Second operand 4 states. [2019-10-15 03:27:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,291 INFO L93 Difference]: Finished difference Result 739 states and 1041 transitions. [2019-10-15 03:27:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-15 03:27:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,296 INFO L225 Difference]: With dead ends: 739 [2019-10-15 03:27:14,296 INFO L226 Difference]: Without dead ends: 379 [2019-10-15 03:27:14,298 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:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-15 03:27:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-10-15 03:27:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-15 03:27:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 522 transitions. [2019-10-15 03:27:14,334 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 522 transitions. Word has length 68 [2019-10-15 03:27:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 522 transitions. [2019-10-15 03:27:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 522 transitions. [2019-10-15 03:27:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:14,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,337 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:14,338 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash -215473092, now seen corresponding path program 1 times [2019-10-15 03:27:14,338 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49228445] [2019-10-15 03:27:14,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,463 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:14,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49228445] [2019-10-15 03:27:14,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629653752] [2019-10-15 03:27:14,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,468 INFO L87 Difference]: Start difference. First operand 379 states and 522 transitions. Second operand 4 states. [2019-10-15 03:27:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,527 INFO L93 Difference]: Finished difference Result 757 states and 1049 transitions. [2019-10-15 03:27:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:27:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,531 INFO L225 Difference]: With dead ends: 757 [2019-10-15 03:27:14,532 INFO L226 Difference]: Without dead ends: 387 [2019-10-15 03:27:14,534 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:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-15 03:27:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2019-10-15 03:27:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-15 03:27:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 528 transitions. [2019-10-15 03:27:14,564 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 528 transitions. Word has length 76 [2019-10-15 03:27:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,567 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 528 transitions. [2019-10-15 03:27:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 528 transitions. [2019-10-15 03:27:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:14,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,573 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:14,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -91522216, now seen corresponding path program 1 times [2019-10-15 03:27:14,574 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842280476] [2019-10-15 03:27:14,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,718 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,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842280476] [2019-10-15 03:27:14,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135913216] [2019-10-15 03:27:14,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,721 INFO L87 Difference]: Start difference. First operand 387 states and 528 transitions. Second operand 4 states. [2019-10-15 03:27:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,781 INFO L93 Difference]: Finished difference Result 775 states and 1069 transitions. [2019-10-15 03:27:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:27:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,785 INFO L225 Difference]: With dead ends: 775 [2019-10-15 03:27:14,785 INFO L226 Difference]: Without dead ends: 397 [2019-10-15 03:27:14,787 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:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-15 03:27:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-15 03:27:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-15 03:27:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 536 transitions. [2019-10-15 03:27:14,812 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 536 transitions. Word has length 76 [2019-10-15 03:27:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:14,813 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 536 transitions. [2019-10-15 03:27:14,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 536 transitions. [2019-10-15 03:27:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-15 03:27:14,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:14,815 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:14,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1911112284, now seen corresponding path program 1 times [2019-10-15 03:27:14,816 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:14,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778757352] [2019-10-15 03:27:14,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:14,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,911 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:14,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778757352] [2019-10-15 03:27:14,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:14,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933283117] [2019-10-15 03:27:14,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:14,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:14,913 INFO L87 Difference]: Start difference. First operand 397 states and 536 transitions. Second operand 4 states. [2019-10-15 03:27:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,985 INFO L93 Difference]: Finished difference Result 797 states and 1083 transitions. [2019-10-15 03:27:14,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:14,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-15 03:27:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,991 INFO L225 Difference]: With dead ends: 797 [2019-10-15 03:27:14,991 INFO L226 Difference]: Without dead ends: 409 [2019-10-15 03:27:14,994 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:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-15 03:27:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-15 03:27:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:27:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 546 transitions. [2019-10-15 03:27:15,023 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 546 transitions. Word has length 84 [2019-10-15 03:27:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,023 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 546 transitions. [2019-10-15 03:27:15,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 546 transitions. [2019-10-15 03:27:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 03:27:15,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,036 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:15,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1631233981, now seen corresponding path program 1 times [2019-10-15 03:27:15,037 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208940513] [2019-10-15 03:27:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,382 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:15,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208940513] [2019-10-15 03:27:15,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:15,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121018942] [2019-10-15 03:27:15,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:15,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:15,384 INFO L87 Difference]: Start difference. First operand 409 states and 546 transitions. Second operand 12 states. [2019-10-15 03:27:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,348 INFO L93 Difference]: Finished difference Result 1292 states and 1697 transitions. [2019-10-15 03:27:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:18,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-15 03:27:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,356 INFO L225 Difference]: With dead ends: 1292 [2019-10-15 03:27:18,356 INFO L226 Difference]: Without dead ends: 892 [2019-10-15 03:27:18,358 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:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-10-15 03:27:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 828. [2019-10-15 03:27:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-15 03:27:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1082 transitions. [2019-10-15 03:27:18,409 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1082 transitions. Word has length 89 [2019-10-15 03:27:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,409 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1082 transitions. [2019-10-15 03:27:18,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1082 transitions. [2019-10-15 03:27:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:27:18,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,412 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,412 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1764502076, now seen corresponding path program 1 times [2019-10-15 03:27:18,413 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948281861] [2019-10-15 03:27:18,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,492 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:18,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948281861] [2019-10-15 03:27:18,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:18,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488405864] [2019-10-15 03:27:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:18,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:18,495 INFO L87 Difference]: Start difference. First operand 828 states and 1082 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,572 INFO L93 Difference]: Finished difference Result 1528 states and 2003 transitions. [2019-10-15 03:27:18,572 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 91 [2019-10-15 03:27:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,578 INFO L225 Difference]: With dead ends: 1528 [2019-10-15 03:27:18,578 INFO L226 Difference]: Without dead ends: 836 [2019-10-15 03:27:18,581 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,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-10-15 03:27:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-10-15 03:27:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-15 03:27:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1078 transitions. [2019-10-15 03:27:18,630 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1078 transitions. Word has length 91 [2019-10-15 03:27:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,630 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1078 transitions. [2019-10-15 03:27:18,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1078 transitions. [2019-10-15 03:27:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 03:27:18,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,632 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,633 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1961062905, now seen corresponding path program 1 times [2019-10-15 03:27:18,633 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084029920] [2019-10-15 03:27:18,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,716 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:18,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084029920] [2019-10-15 03:27:18,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:18,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412400616] [2019-10-15 03:27:18,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:18,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:18,718 INFO L87 Difference]: Start difference. First operand 836 states and 1078 transitions. Second operand 4 states. [2019-10-15 03:27:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,769 INFO L93 Difference]: Finished difference Result 1494 states and 1929 transitions. [2019-10-15 03:27:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:18,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-15 03:27:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,775 INFO L225 Difference]: With dead ends: 1494 [2019-10-15 03:27:18,775 INFO L226 Difference]: Without dead ends: 828 [2019-10-15 03:27:18,777 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,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-15 03:27:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-10-15 03:27:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-15 03:27:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1054 transitions. [2019-10-15 03:27:18,825 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1054 transitions. Word has length 93 [2019-10-15 03:27:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:18,826 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1054 transitions. [2019-10-15 03:27:18,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1054 transitions. [2019-10-15 03:27:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:27:18,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:18,828 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:18,828 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash 534163009, now seen corresponding path program 1 times [2019-10-15 03:27:18,829 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:18,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333027772] [2019-10-15 03:27:18,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:18,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:18,989 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:18,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333027772] [2019-10-15 03:27:18,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:18,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:27:18,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269315561] [2019-10-15 03:27:18,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:27:18,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:27:18,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:27:18,991 INFO L87 Difference]: Start difference. First operand 828 states and 1054 transitions. Second operand 8 states. [2019-10-15 03:27:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,411 INFO L93 Difference]: Finished difference Result 1237 states and 1586 transitions. [2019-10-15 03:27:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:19,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-15 03:27:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,420 INFO L225 Difference]: With dead ends: 1237 [2019-10-15 03:27:19,420 INFO L226 Difference]: Without dead ends: 1235 [2019-10-15 03:27:19,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-10-15 03:27:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1168. [2019-10-15 03:27:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-10-15 03:27:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1484 transitions. [2019-10-15 03:27:19,487 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1484 transitions. Word has length 92 [2019-10-15 03:27:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,489 INFO L462 AbstractCegarLoop]: Abstraction has 1168 states and 1484 transitions. [2019-10-15 03:27:19,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:27:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1484 transitions. [2019-10-15 03:27:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:27:19,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,491 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:19,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1249614211, now seen corresponding path program 1 times [2019-10-15 03:27:19,492 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195897320] [2019-10-15 03:27:19,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:19,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195897320] [2019-10-15 03:27:19,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:19,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:27:19,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305607039] [2019-10-15 03:27:19,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:27:19,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:27:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:19,627 INFO L87 Difference]: Start difference. First operand 1168 states and 1484 transitions. Second operand 7 states. [2019-10-15 03:27:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:19,726 INFO L93 Difference]: Finished difference Result 1217 states and 1562 transitions. [2019-10-15 03:27:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:27:19,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-15 03:27:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:19,734 INFO L225 Difference]: With dead ends: 1217 [2019-10-15 03:27:19,734 INFO L226 Difference]: Without dead ends: 1215 [2019-10-15 03:27:19,735 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:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-10-15 03:27:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 848. [2019-10-15 03:27:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-15 03:27:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1076 transitions. [2019-10-15 03:27:19,786 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1076 transitions. Word has length 92 [2019-10-15 03:27:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,786 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1076 transitions. [2019-10-15 03:27:19,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1076 transitions. [2019-10-15 03:27:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 03:27:19,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,788 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:19,789 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -371642591, now seen corresponding path program 1 times [2019-10-15 03:27:19,789 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717058018] [2019-10-15 03:27:19,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:27:20,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717058018] [2019-10-15 03:27:20,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:20,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:27:20,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666550652] [2019-10-15 03:27:20,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:27:20,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:27:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:27:20,016 INFO L87 Difference]: Start difference. First operand 848 states and 1076 transitions. Second operand 12 states. [2019-10-15 03:27:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,236 INFO L93 Difference]: Finished difference Result 2444 states and 3060 transitions. [2019-10-15 03:27:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 03:27:23,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-15 03:27:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,248 INFO L225 Difference]: With dead ends: 2444 [2019-10-15 03:27:23,248 INFO L226 Difference]: Without dead ends: 1766 [2019-10-15 03:27:23,252 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:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-10-15 03:27:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1373. [2019-10-15 03:27:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-10-15 03:27:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1730 transitions. [2019-10-15 03:27:23,331 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1730 transitions. Word has length 97 [2019-10-15 03:27:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,331 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 1730 transitions. [2019-10-15 03:27:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:27:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1730 transitions. [2019-10-15 03:27:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 03:27:23,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,334 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:23,335 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash -91002566, now seen corresponding path program 1 times [2019-10-15 03:27:23,336 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386041021] [2019-10-15 03:27:23,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,442 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:23,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386041021] [2019-10-15 03:27:23,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:23,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203845642] [2019-10-15 03:27:23,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:23,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:23,444 INFO L87 Difference]: Start difference. First operand 1373 states and 1730 transitions. Second operand 5 states. [2019-10-15 03:27:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,893 INFO L93 Difference]: Finished difference Result 4907 states and 6257 transitions. [2019-10-15 03:27:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:23,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 03:27:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,915 INFO L225 Difference]: With dead ends: 4907 [2019-10-15 03:27:23,915 INFO L226 Difference]: Without dead ends: 3694 [2019-10-15 03:27:23,922 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:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-10-15 03:27:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3436. [2019-10-15 03:27:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-10-15 03:27:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4348 transitions. [2019-10-15 03:27:24,111 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4348 transitions. Word has length 98 [2019-10-15 03:27:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,111 INFO L462 AbstractCegarLoop]: Abstraction has 3436 states and 4348 transitions. [2019-10-15 03:27:24,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4348 transitions. [2019-10-15 03:27:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 03:27:24,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,114 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:24,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1778951428, now seen corresponding path program 1 times [2019-10-15 03:27:24,115 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657196049] [2019-10-15 03:27:24,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,289 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:24,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657196049] [2019-10-15 03:27:24,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:24,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908579195] [2019-10-15 03:27:24,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:24,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:24,291 INFO L87 Difference]: Start difference. First operand 3436 states and 4348 transitions. Second operand 9 states. [2019-10-15 03:27:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,540 INFO L93 Difference]: Finished difference Result 7473 states and 9491 transitions. [2019-10-15 03:27:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:25,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-15 03:27:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,567 INFO L225 Difference]: With dead ends: 7473 [2019-10-15 03:27:25,568 INFO L226 Difference]: Without dead ends: 4401 [2019-10-15 03:27:25,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2019-10-15 03:27:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3986. [2019-10-15 03:27:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3986 states. [2019-10-15 03:27:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5033 transitions. [2019-10-15 03:27:25,786 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5033 transitions. Word has length 98 [2019-10-15 03:27:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,787 INFO L462 AbstractCegarLoop]: Abstraction has 3986 states and 5033 transitions. [2019-10-15 03:27:25,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5033 transitions. [2019-10-15 03:27:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 03:27:25,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,790 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:25,790 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash -693645360, now seen corresponding path program 1 times [2019-10-15 03:27:25,791 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855823927] [2019-10-15 03:27:25,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:27:25,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855823927] [2019-10-15 03:27:25,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:25,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285247383] [2019-10-15 03:27:25,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:25,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:25,999 INFO L87 Difference]: Start difference. First operand 3986 states and 5033 transitions. Second operand 9 states. [2019-10-15 03:27:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:27,458 INFO L93 Difference]: Finished difference Result 7879 states and 10135 transitions. [2019-10-15 03:27:27,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:27:27,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-15 03:27:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:27,486 INFO L225 Difference]: With dead ends: 7879 [2019-10-15 03:27:27,486 INFO L226 Difference]: Without dead ends: 4293 [2019-10-15 03:27:27,497 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:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2019-10-15 03:27:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3731. [2019-10-15 03:27:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-10-15 03:27:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4730 transitions. [2019-10-15 03:27:27,702 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4730 transitions. Word has length 100 [2019-10-15 03:27:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:27,702 INFO L462 AbstractCegarLoop]: Abstraction has 3731 states and 4730 transitions. [2019-10-15 03:27:27,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4730 transitions. [2019-10-15 03:27:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:27,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:27,706 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:27,706 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash 47221803, now seen corresponding path program 1 times [2019-10-15 03:27:27,707 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:27,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93820284] [2019-10-15 03:27:27,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:27,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:27,801 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:27,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93820284] [2019-10-15 03:27:27,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:27,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:27,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286023374] [2019-10-15 03:27:27,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:27,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:27,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:27,804 INFO L87 Difference]: Start difference. First operand 3731 states and 4730 transitions. Second operand 4 states. [2019-10-15 03:27:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:28,004 INFO L93 Difference]: Finished difference Result 6991 states and 8932 transitions. [2019-10-15 03:27:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:28,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-15 03:27:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:28,025 INFO L225 Difference]: With dead ends: 6991 [2019-10-15 03:27:28,025 INFO L226 Difference]: Without dead ends: 3673 [2019-10-15 03:27:28,036 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:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-10-15 03:27:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3673. [2019-10-15 03:27:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-10-15 03:27:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4556 transitions. [2019-10-15 03:27:28,206 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4556 transitions. Word has length 102 [2019-10-15 03:27:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:28,206 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4556 transitions. [2019-10-15 03:27:28,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4556 transitions. [2019-10-15 03:27:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:28,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:28,210 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,210 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1122908653, now seen corresponding path program 1 times [2019-10-15 03:27:28,210 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:28,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144827063] [2019-10-15 03:27:28,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:28,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:28,280 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,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144827063] [2019-10-15 03:27:28,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:28,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:28,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402526744] [2019-10-15 03:27:28,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:28,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:28,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:28,283 INFO L87 Difference]: Start difference. First operand 3673 states and 4556 transitions. Second operand 5 states. [2019-10-15 03:27:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:29,013 INFO L93 Difference]: Finished difference Result 11003 states and 13589 transitions. [2019-10-15 03:27:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:29,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:29,056 INFO L225 Difference]: With dead ends: 11003 [2019-10-15 03:27:29,056 INFO L226 Difference]: Without dead ends: 7835 [2019-10-15 03:27:29,065 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,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-10-15 03:27:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 6172. [2019-10-15 03:27:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6172 states. [2019-10-15 03:27:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 7614 transitions. [2019-10-15 03:27:29,345 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 7614 transitions. Word has length 102 [2019-10-15 03:27:29,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:29,345 INFO L462 AbstractCegarLoop]: Abstraction has 6172 states and 7614 transitions. [2019-10-15 03:27:29,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 7614 transitions. [2019-10-15 03:27:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 03:27:29,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:29,348 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:29,348 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -311747556, now seen corresponding path program 1 times [2019-10-15 03:27:29,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:29,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765766355] [2019-10-15 03:27:29,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:29,416 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:29,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765766355] [2019-10-15 03:27:29,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:29,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:29,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616349031] [2019-10-15 03:27:29,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:29,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:29,418 INFO L87 Difference]: Start difference. First operand 6172 states and 7614 transitions. Second operand 5 states. [2019-10-15 03:27:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:30,149 INFO L93 Difference]: Finished difference Result 14042 states and 17225 transitions. [2019-10-15 03:27:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:27:30,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 03:27:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:30,179 INFO L225 Difference]: With dead ends: 14042 [2019-10-15 03:27:30,180 INFO L226 Difference]: Without dead ends: 8565 [2019-10-15 03:27:30,194 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:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2019-10-15 03:27:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 8209. [2019-10-15 03:27:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8209 states. [2019-10-15 03:27:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8209 states to 8209 states and 10035 transitions. [2019-10-15 03:27:30,630 INFO L78 Accepts]: Start accepts. Automaton has 8209 states and 10035 transitions. Word has length 102 [2019-10-15 03:27:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:30,631 INFO L462 AbstractCegarLoop]: Abstraction has 8209 states and 10035 transitions. [2019-10-15 03:27:30,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8209 states and 10035 transitions. [2019-10-15 03:27:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 03:27:30,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:30,643 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:30,643 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1621883247, now seen corresponding path program 1 times [2019-10-15 03:27:30,644 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:30,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754818912] [2019-10-15 03:27:30,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:30,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:30,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:30,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754818912] [2019-10-15 03:27:30,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:30,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:30,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026496620] [2019-10-15 03:27:30,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:30,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:30,706 INFO L87 Difference]: Start difference. First operand 8209 states and 10035 transitions. Second operand 3 states. [2019-10-15 03:27:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:31,111 INFO L93 Difference]: Finished difference Result 15768 states and 19208 transitions. [2019-10-15 03:27:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:31,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-15 03:27:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:31,140 INFO L225 Difference]: With dead ends: 15768 [2019-10-15 03:27:31,140 INFO L226 Difference]: Without dead ends: 8248 [2019-10-15 03:27:31,157 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:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2019-10-15 03:27:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8215. [2019-10-15 03:27:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8215 states. [2019-10-15 03:27:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 10041 transitions. [2019-10-15 03:27:31,546 INFO L78 Accepts]: Start accepts. Automaton has 8215 states and 10041 transitions. Word has length 103 [2019-10-15 03:27:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:31,547 INFO L462 AbstractCegarLoop]: Abstraction has 8215 states and 10041 transitions. [2019-10-15 03:27:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8215 states and 10041 transitions. [2019-10-15 03:27:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 03:27:31,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:31,552 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:31,552 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1474773640, now seen corresponding path program 1 times [2019-10-15 03:27:31,553 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:31,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473483373] [2019-10-15 03:27:31,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:31,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473483373] [2019-10-15 03:27:31,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:31,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:27:31,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008029705] [2019-10-15 03:27:31,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:27:31,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:27:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:27:31,808 INFO L87 Difference]: Start difference. First operand 8215 states and 10041 transitions. Second operand 9 states. [2019-10-15 03:27:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:33,507 INFO L93 Difference]: Finished difference Result 15712 states and 19102 transitions. [2019-10-15 03:27:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:27:33,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-15 03:27:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:33,536 INFO L225 Difference]: With dead ends: 15712 [2019-10-15 03:27:33,537 INFO L226 Difference]: Without dead ends: 7677 [2019-10-15 03:27:33,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:27:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7677 states. [2019-10-15 03:27:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7677 to 6930. [2019-10-15 03:27:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6930 states. [2019-10-15 03:27:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 8386 transitions. [2019-10-15 03:27:33,879 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 8386 transitions. Word has length 104 [2019-10-15 03:27:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:33,879 INFO L462 AbstractCegarLoop]: Abstraction has 6930 states and 8386 transitions. [2019-10-15 03:27:33,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:27:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 8386 transitions. [2019-10-15 03:27:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 03:27:33,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:33,882 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:33,882 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1828873027, now seen corresponding path program 1 times [2019-10-15 03:27:33,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:33,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719325905] [2019-10-15 03:27:33,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:33,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:27:34,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719325905] [2019-10-15 03:27:34,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:34,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:27:34,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132601595] [2019-10-15 03:27:34,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:27:34,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:27:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:27:34,085 INFO L87 Difference]: Start difference. First operand 6930 states and 8386 transitions. Second operand 8 states. [2019-10-15 03:27:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:35,466 INFO L93 Difference]: Finished difference Result 13615 states and 16453 transitions. [2019-10-15 03:27:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:27:35,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-15 03:27:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:35,496 INFO L225 Difference]: With dead ends: 13615 [2019-10-15 03:27:35,496 INFO L226 Difference]: Without dead ends: 6974 [2019-10-15 03:27:35,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:27:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-10-15 03:27:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6772. [2019-10-15 03:27:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6772 states. [2019-10-15 03:27:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 8178 transitions. [2019-10-15 03:27:35,912 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 8178 transitions. Word has length 105 [2019-10-15 03:27:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:35,912 INFO L462 AbstractCegarLoop]: Abstraction has 6772 states and 8178 transitions. [2019-10-15 03:27:35,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:27:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 8178 transitions. [2019-10-15 03:27:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:27:35,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:35,915 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:35,915 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash -653612548, now seen corresponding path program 1 times [2019-10-15 03:27:35,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:35,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186474079] [2019-10-15 03:27:35,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:35,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:35,989 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,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186474079] [2019-10-15 03:27:35,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:35,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:35,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61799194] [2019-10-15 03:27:35,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:35,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:35,994 INFO L87 Difference]: Start difference. First operand 6772 states and 8178 transitions. Second operand 4 states. [2019-10-15 03:27:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:36,399 INFO L93 Difference]: Finished difference Result 13109 states and 15788 transitions. [2019-10-15 03:27:36,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:36,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 03:27:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:36,422 INFO L225 Difference]: With dead ends: 13109 [2019-10-15 03:27:36,422 INFO L226 Difference]: Without dead ends: 6626 [2019-10-15 03:27:36,431 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:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-10-15 03:27:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6267. [2019-10-15 03:27:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2019-10-15 03:27:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 7549 transitions. [2019-10-15 03:27:36,802 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 7549 transitions. Word has length 106 [2019-10-15 03:27:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:36,802 INFO L462 AbstractCegarLoop]: Abstraction has 6267 states and 7549 transitions. [2019-10-15 03:27:36,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 7549 transitions. [2019-10-15 03:27:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 03:27:36,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:36,805 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:36,805 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2135673103, now seen corresponding path program 1 times [2019-10-15 03:27:36,806 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:36,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617170293] [2019-10-15 03:27:36,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 03:27:36,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617170293] [2019-10-15 03:27:36,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:36,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:36,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796257978] [2019-10-15 03:27:36,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:36,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:36,902 INFO L87 Difference]: Start difference. First operand 6267 states and 7549 transitions. Second operand 4 states. [2019-10-15 03:27:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:37,148 INFO L93 Difference]: Finished difference Result 12146 states and 14755 transitions. [2019-10-15 03:27:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:37,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-15 03:27:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:37,168 INFO L225 Difference]: With dead ends: 12146 [2019-10-15 03:27:37,168 INFO L226 Difference]: Without dead ends: 6147 [2019-10-15 03:27:37,180 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:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2019-10-15 03:27:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5769. [2019-10-15 03:27:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2019-10-15 03:27:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 6709 transitions. [2019-10-15 03:27:37,629 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 6709 transitions. Word has length 118 [2019-10-15 03:27:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:37,629 INFO L462 AbstractCegarLoop]: Abstraction has 5769 states and 6709 transitions. [2019-10-15 03:27:37,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 6709 transitions. [2019-10-15 03:27:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 03:27:37,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:37,633 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:37,633 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash -395511045, now seen corresponding path program 1 times [2019-10-15 03:27:37,634 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:37,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857999115] [2019-10-15 03:27:37,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:37,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:37,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-15 03:27:37,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857999115] [2019-10-15 03:27:37,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:37,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:37,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868926690] [2019-10-15 03:27:37,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:37,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:37,721 INFO L87 Difference]: Start difference. First operand 5769 states and 6709 transitions. Second operand 4 states. [2019-10-15 03:27:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:37,963 INFO L93 Difference]: Finished difference Result 11112 states and 12961 transitions. [2019-10-15 03:27:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:37,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-15 03:27:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:37,980 INFO L225 Difference]: With dead ends: 11112 [2019-10-15 03:27:37,980 INFO L226 Difference]: Without dead ends: 5631 [2019-10-15 03:27:37,991 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:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-10-15 03:27:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5227. [2019-10-15 03:27:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2019-10-15 03:27:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 5900 transitions. [2019-10-15 03:27:38,207 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 5900 transitions. Word has length 134 [2019-10-15 03:27:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:38,207 INFO L462 AbstractCegarLoop]: Abstraction has 5227 states and 5900 transitions. [2019-10-15 03:27:38,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 5900 transitions. [2019-10-15 03:27:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 03:27:38,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:38,211 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:38,212 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 437841812, now seen corresponding path program 1 times [2019-10-15 03:27:38,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:38,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659231177] [2019-10-15 03:27:38,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:38,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-15 03:27:38,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659231177] [2019-10-15 03:27:38,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712005202] [2019-10-15 03:27:38,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:27:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:38,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-15 03:27:38,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:27:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 03:27:38,891 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:27:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-15 03:27:39,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:27:39,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-15 03:27:39,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012372749] [2019-10-15 03:27:39,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:27:39,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:27:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-15 03:27:39,371 INFO L87 Difference]: Start difference. First operand 5227 states and 5900 transitions. Second operand 11 states. [2019-10-15 03:27:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:41,557 INFO L93 Difference]: Finished difference Result 11715 states and 13141 transitions. [2019-10-15 03:27:41,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:27:41,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2019-10-15 03:27:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:41,585 INFO L225 Difference]: With dead ends: 11715 [2019-10-15 03:27:41,585 INFO L226 Difference]: Without dead ends: 6708 [2019-10-15 03:27:41,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 276 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190