java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:54:16,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:16,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:16,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:16,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:16,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:16,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:17,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:17,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:17,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:17,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:17,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:17,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:17,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:17,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:17,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:17,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:17,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:17,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:17,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:17,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:17,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:17,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:17,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:17,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:17,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:17,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:17,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:17,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:17,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:17,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:17,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:17,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:17,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:17,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:17,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:17,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:17,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:17,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:17,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:17,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:17,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:54:17,069 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:17,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:17,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:17,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:17,079 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:17,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:17,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:17,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:17,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:17,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:17,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:17,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:17,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:17,083 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:17,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:17,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:17,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:17,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:17,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:17,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:17,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:17,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:17,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:17,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:17,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:17,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:17,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:17,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:17,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:54:17,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:17,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:17,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:17,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:17,380 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:17,380 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:17,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3ccf1a3/617ce2b87eef4c6680ca4642d6c920a8/FLAG35d90dd13 [2019-10-07 15:54:17,972 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:17,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:17,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3ccf1a3/617ce2b87eef4c6680ca4642d6c920a8/FLAG35d90dd13 [2019-10-07 15:54:18,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3ccf1a3/617ce2b87eef4c6680ca4642d6c920a8 [2019-10-07 15:54:18,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:18,323 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:18,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:18,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:18,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:18,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d974c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18, skipping insertion in model container [2019-10-07 15:54:18,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:18,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:18,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:18,765 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:18,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:18,879 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:18,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18 WrapperNode [2019-10-07 15:54:18,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:18,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:18,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:18,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:18,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... [2019-10-07 15:54:18,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:18,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:18,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:18,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:18,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:19,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-07 15:54:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-07 15:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-07 15:54:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-07 15:54:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-07 15:54:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-07 15:54:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-07 15:54:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:20,399 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:20,399 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 15:54:20,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:20 BoogieIcfgContainer [2019-10-07 15:54:20,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:20,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:20,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:20,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:20,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:18" (1/3) ... [2019-10-07 15:54:20,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2421c867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:20, skipping insertion in model container [2019-10-07 15:54:20,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:18" (2/3) ... [2019-10-07 15:54:20,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2421c867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:20, skipping insertion in model container [2019-10-07 15:54:20,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:20" (3/3) ... [2019-10-07 15:54:20,413 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:20,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:20,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:20,444 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:20,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:20,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:20,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:20,486 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:20,487 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:20,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:20,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:20,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-10-07 15:54:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 15:54:20,521 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:20,522 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:20,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1264389532, now seen corresponding path program 1 times [2019-10-07 15:54:20,539 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:20,539 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:21,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,045 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,046 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,071 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2019-10-07 15:54:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,233 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2019-10-07 15:54:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-07 15:54:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,250 INFO L225 Difference]: With dead ends: 365 [2019-10-07 15:54:21,251 INFO L226 Difference]: Without dead ends: 186 [2019-10-07 15:54:21,258 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-07 15:54:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-07 15:54:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-07 15:54:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2019-10-07 15:54:21,330 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 44 [2019-10-07 15:54:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,331 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-10-07 15:54:21,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2019-10-07 15:54:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 15:54:21,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,334 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:21,335 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 118430116, now seen corresponding path program 1 times [2019-10-07 15:54:21,336 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,336 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:21,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,566 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,567 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:21,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:21,578 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 7 states. [2019-10-07 15:54:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:22,742 INFO L93 Difference]: Finished difference Result 418 states and 592 transitions. [2019-10-07 15:54:22,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:54:22,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-07 15:54:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:22,748 INFO L225 Difference]: With dead ends: 418 [2019-10-07 15:54:22,749 INFO L226 Difference]: Without dead ends: 241 [2019-10-07 15:54:22,751 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-07 15:54:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-10-07 15:54:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-07 15:54:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-07 15:54:22,782 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 59 [2019-10-07 15:54:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:22,783 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-07 15:54:22,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-07 15:54:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 15:54:22,786 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:22,786 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:22,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1173692886, now seen corresponding path program 1 times [2019-10-07 15:54:22,790 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:22,790 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,790 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:22,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:22,915 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:22,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:22,918 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 7 states. [2019-10-07 15:54:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:23,884 INFO L93 Difference]: Finished difference Result 424 states and 600 transitions. [2019-10-07 15:54:23,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:54:23,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-07 15:54:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:23,888 INFO L225 Difference]: With dead ends: 424 [2019-10-07 15:54:23,888 INFO L226 Difference]: Without dead ends: 244 [2019-10-07 15:54:23,889 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-07 15:54:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2019-10-07 15:54:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-07 15:54:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-07 15:54:23,922 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 60 [2019-10-07 15:54:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:23,922 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-07 15:54:23,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-07 15:54:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 15:54:23,924 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:23,924 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:23,925 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -245947725, now seen corresponding path program 1 times [2019-10-07 15:54:23,925 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:23,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:23,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:23,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:24,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,039 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:24,039 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:24,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:24,041 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 5 states. [2019-10-07 15:54:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:24,136 INFO L93 Difference]: Finished difference Result 830 states and 1168 transitions. [2019-10-07 15:54:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:24,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 15:54:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:24,142 INFO L225 Difference]: With dead ends: 830 [2019-10-07 15:54:24,142 INFO L226 Difference]: Without dead ends: 615 [2019-10-07 15:54:24,144 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-07 15:54:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 456. [2019-10-07 15:54:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-07 15:54:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 636 transitions. [2019-10-07 15:54:24,205 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 636 transitions. Word has length 62 [2019-10-07 15:54:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:24,207 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 636 transitions. [2019-10-07 15:54:24,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 636 transitions. [2019-10-07 15:54:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 15:54:24,214 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:24,215 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:24,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1570515984, now seen corresponding path program 1 times [2019-10-07 15:54:24,216 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:24,216 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,216 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,216 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:24,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,360 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:24,360 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:24,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:24,362 INFO L87 Difference]: Start difference. First operand 456 states and 636 transitions. Second operand 4 states. [2019-10-07 15:54:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:24,443 INFO L93 Difference]: Finished difference Result 832 states and 1175 transitions. [2019-10-07 15:54:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:24,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-07 15:54:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:24,449 INFO L225 Difference]: With dead ends: 832 [2019-10-07 15:54:24,449 INFO L226 Difference]: Without dead ends: 466 [2019-10-07 15:54:24,451 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-07 15:54:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-07 15:54:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-07 15:54:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 644 transitions. [2019-10-07 15:54:24,506 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 644 transitions. Word has length 64 [2019-10-07 15:54:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:24,507 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 644 transitions. [2019-10-07 15:54:24,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 644 transitions. [2019-10-07 15:54:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 15:54:24,510 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:24,510 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:24,510 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1373912432, now seen corresponding path program 1 times [2019-10-07 15:54:24,511 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:24,511 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:24,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,657 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:24,657 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:24,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:24,663 INFO L87 Difference]: Start difference. First operand 466 states and 644 transitions. Second operand 4 states. [2019-10-07 15:54:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:24,734 INFO L93 Difference]: Finished difference Result 852 states and 1197 transitions. [2019-10-07 15:54:24,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:24,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-07 15:54:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:24,740 INFO L225 Difference]: With dead ends: 852 [2019-10-07 15:54:24,741 INFO L226 Difference]: Without dead ends: 476 [2019-10-07 15:54:24,744 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-07 15:54:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-07 15:54:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-07 15:54:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 652 transitions. [2019-10-07 15:54:24,781 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 652 transitions. Word has length 72 [2019-10-07 15:54:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:24,783 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 652 transitions. [2019-10-07 15:54:24,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 652 transitions. [2019-10-07 15:54:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 15:54:24,785 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:24,785 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:24,785 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1336802682, now seen corresponding path program 1 times [2019-10-07 15:54:24,786 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:24,786 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,786 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,787 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:24,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:24,906 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:24,906 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:24,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:24,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:24,908 INFO L87 Difference]: Start difference. First operand 476 states and 652 transitions. Second operand 4 states. [2019-10-07 15:54:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:24,969 INFO L93 Difference]: Finished difference Result 870 states and 1205 transitions. [2019-10-07 15:54:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:24,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 15:54:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:24,974 INFO L225 Difference]: With dead ends: 870 [2019-10-07 15:54:24,974 INFO L226 Difference]: Without dead ends: 484 [2019-10-07 15:54:24,976 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-10-07 15:54:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-10-07 15:54:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-07 15:54:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 658 transitions. [2019-10-07 15:54:25,007 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 658 transitions. Word has length 80 [2019-10-07 15:54:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,008 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 658 transitions. [2019-10-07 15:54:25,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 658 transitions. [2019-10-07 15:54:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 15:54:25,009 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,009 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:25,010 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash -392875626, now seen corresponding path program 1 times [2019-10-07 15:54:25,010 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,011 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,011 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,011 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 15:54:25,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,091 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,091 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,093 INFO L87 Difference]: Start difference. First operand 484 states and 658 transitions. Second operand 4 states. [2019-10-07 15:54:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,175 INFO L93 Difference]: Finished difference Result 888 states and 1225 transitions. [2019-10-07 15:54:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-07 15:54:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,180 INFO L225 Difference]: With dead ends: 888 [2019-10-07 15:54:25,180 INFO L226 Difference]: Without dead ends: 494 [2019-10-07 15:54:25,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-07 15:54:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-07 15:54:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-07 15:54:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 666 transitions. [2019-10-07 15:54:25,244 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 666 transitions. Word has length 80 [2019-10-07 15:54:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,245 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 666 transitions. [2019-10-07 15:54:25,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 666 transitions. [2019-10-07 15:54:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 15:54:25,247 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,247 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:25,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash 871987098, now seen corresponding path program 1 times [2019-10-07 15:54:25,249 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,249 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,249 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,249 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 15:54:25,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,355 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,355 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,357 INFO L87 Difference]: Start difference. First operand 494 states and 666 transitions. Second operand 4 states. [2019-10-07 15:54:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,414 INFO L93 Difference]: Finished difference Result 910 states and 1239 transitions. [2019-10-07 15:54:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-07 15:54:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,421 INFO L225 Difference]: With dead ends: 910 [2019-10-07 15:54:25,421 INFO L226 Difference]: Without dead ends: 506 [2019-10-07 15:54:25,423 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-07 15:54:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-10-07 15:54:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-07 15:54:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 676 transitions. [2019-10-07 15:54:25,456 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 676 transitions. Word has length 88 [2019-10-07 15:54:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,458 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 676 transitions. [2019-10-07 15:54:25,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 676 transitions. [2019-10-07 15:54:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-07 15:54:25,464 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,464 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:25,465 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1679018407, now seen corresponding path program 1 times [2019-10-07 15:54:25,465 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,466 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 15:54:25,721 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,721 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,721 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:25,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:25,722 INFO L87 Difference]: Start difference. First operand 506 states and 676 transitions. Second operand 12 states. [2019-10-07 15:54:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:28,545 INFO L93 Difference]: Finished difference Result 1348 states and 1779 transitions. [2019-10-07 15:54:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:28,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-07 15:54:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:28,552 INFO L225 Difference]: With dead ends: 1348 [2019-10-07 15:54:28,552 INFO L226 Difference]: Without dead ends: 926 [2019-10-07 15:54:28,554 INFO L606 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-07 15:54:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-10-07 15:54:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 856. [2019-10-07 15:54:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-07 15:54:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1120 transitions. [2019-10-07 15:54:28,605 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1120 transitions. Word has length 93 [2019-10-07 15:54:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:28,605 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1120 transitions. [2019-10-07 15:54:28,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1120 transitions. [2019-10-07 15:54:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-07 15:54:28,607 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:28,608 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:28,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash 43626938, now seen corresponding path program 1 times [2019-10-07 15:54:28,608 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:28,609 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,609 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,609 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 15:54:28,677 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,677 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:28,677 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:28,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:28,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:28,679 INFO L87 Difference]: Start difference. First operand 856 states and 1120 transitions. Second operand 4 states. [2019-10-07 15:54:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:28,750 INFO L93 Difference]: Finished difference Result 1566 states and 2059 transitions. [2019-10-07 15:54:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:28,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-07 15:54:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:28,756 INFO L225 Difference]: With dead ends: 1566 [2019-10-07 15:54:28,756 INFO L226 Difference]: Without dead ends: 864 [2019-10-07 15:54:28,759 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-10-07 15:54:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-10-07 15:54:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-07 15:54:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1116 transitions. [2019-10-07 15:54:28,818 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1116 transitions. Word has length 95 [2019-10-07 15:54:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:28,818 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1116 transitions. [2019-10-07 15:54:28,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1116 transitions. [2019-10-07 15:54:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 15:54:28,820 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:28,820 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:28,821 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 549476847, now seen corresponding path program 1 times [2019-10-07 15:54:28,821 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:28,822 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:28,938 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,938 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:28,939 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:28,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:28,940 INFO L87 Difference]: Start difference. First operand 864 states and 1116 transitions. Second operand 4 states. [2019-10-07 15:54:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:28,998 INFO L93 Difference]: Finished difference Result 1532 states and 1985 transitions. [2019-10-07 15:54:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:28,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-07 15:54:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,004 INFO L225 Difference]: With dead ends: 1532 [2019-10-07 15:54:29,004 INFO L226 Difference]: Without dead ends: 856 [2019-10-07 15:54:29,007 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-07 15:54:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2019-10-07 15:54:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-07 15:54:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1092 transitions. [2019-10-07 15:54:29,056 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1092 transitions. Word has length 97 [2019-10-07 15:54:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1092 transitions. [2019-10-07 15:54:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1092 transitions. [2019-10-07 15:54:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 15:54:29,058 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,058 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:29,059 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1263786637, now seen corresponding path program 1 times [2019-10-07 15:54:29,059 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,059 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,060 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:29,185 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,185 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:29,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:29,187 INFO L87 Difference]: Start difference. First operand 856 states and 1092 transitions. Second operand 7 states. [2019-10-07 15:54:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,307 INFO L93 Difference]: Finished difference Result 916 states and 1178 transitions. [2019-10-07 15:54:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 15:54:29,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-07 15:54:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,315 INFO L225 Difference]: With dead ends: 916 [2019-10-07 15:54:29,315 INFO L226 Difference]: Without dead ends: 914 [2019-10-07 15:54:29,316 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-07 15:54:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 876. [2019-10-07 15:54:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-07 15:54:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1114 transitions. [2019-10-07 15:54:29,376 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1114 transitions. Word has length 96 [2019-10-07 15:54:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,377 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1114 transitions. [2019-10-07 15:54:29,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1114 transitions. [2019-10-07 15:54:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-07 15:54:29,380 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,381 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:29,381 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash 199062795, now seen corresponding path program 1 times [2019-10-07 15:54:29,382 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,382 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,382 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,382 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:29,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,643 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,644 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:29,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:29,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:29,645 INFO L87 Difference]: Start difference. First operand 876 states and 1114 transitions. Second operand 12 states. [2019-10-07 15:54:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:33,079 INFO L93 Difference]: Finished difference Result 2482 states and 3116 transitions. [2019-10-07 15:54:33,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:33,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-07 15:54:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:33,089 INFO L225 Difference]: With dead ends: 2482 [2019-10-07 15:54:33,089 INFO L226 Difference]: Without dead ends: 1794 [2019-10-07 15:54:33,093 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-10-07 15:54:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1401. [2019-10-07 15:54:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-07 15:54:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1768 transitions. [2019-10-07 15:54:33,176 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1768 transitions. Word has length 101 [2019-10-07 15:54:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:33,176 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1768 transitions. [2019-10-07 15:54:33,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1768 transitions. [2019-10-07 15:54:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:33,179 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:33,179 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:33,179 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1539640288, now seen corresponding path program 1 times [2019-10-07 15:54:33,180 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:33,180 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:33,180 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,181 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 15:54:33,403 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:33,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:33,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:33,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:33,405 INFO L87 Difference]: Start difference. First operand 1401 states and 1768 transitions. Second operand 9 states. [2019-10-07 15:54:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:34,672 INFO L93 Difference]: Finished difference Result 3418 states and 4363 transitions. [2019-10-07 15:54:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:34,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-07 15:54:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:34,685 INFO L225 Difference]: With dead ends: 3418 [2019-10-07 15:54:34,685 INFO L226 Difference]: Without dead ends: 2224 [2019-10-07 15:54:34,690 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-07 15:54:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-10-07 15:54:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1963. [2019-10-07 15:54:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-10-07 15:54:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2470 transitions. [2019-10-07 15:54:34,806 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2470 transitions. Word has length 102 [2019-10-07 15:54:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:34,806 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2470 transitions. [2019-10-07 15:54:34,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2470 transitions. [2019-10-07 15:54:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:34,809 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:34,809 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:34,809 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash 823112389, now seen corresponding path program 1 times [2019-10-07 15:54:34,810 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:34,810 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,810 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,810 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:34,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,897 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:34,897 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:34,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:34,899 INFO L87 Difference]: Start difference. First operand 1963 states and 2470 transitions. Second operand 5 states. [2019-10-07 15:54:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:35,450 INFO L93 Difference]: Finished difference Result 6113 states and 7766 transitions. [2019-10-07 15:54:35,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:35,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:35,481 INFO L225 Difference]: With dead ends: 6113 [2019-10-07 15:54:35,482 INFO L226 Difference]: Without dead ends: 4402 [2019-10-07 15:54:35,493 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-10-07 15:54:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4056. [2019-10-07 15:54:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4056 states. [2019-10-07 15:54:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5128 transitions. [2019-10-07 15:54:35,840 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5128 transitions. Word has length 102 [2019-10-07 15:54:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:35,841 INFO L462 AbstractCegarLoop]: Abstraction has 4056 states and 5128 transitions. [2019-10-07 15:54:35,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5128 transitions. [2019-10-07 15:54:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 15:54:35,844 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:35,845 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:35,845 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -637002213, now seen corresponding path program 1 times [2019-10-07 15:54:35,846 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:35,846 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:35,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 15:54:36,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:36,039 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:36,040 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:36,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:36,041 INFO L87 Difference]: Start difference. First operand 4056 states and 5128 transitions. Second operand 9 states. [2019-10-07 15:54:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:37,504 INFO L93 Difference]: Finished difference Result 7974 states and 10275 transitions. [2019-10-07 15:54:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:37,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-07 15:54:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:37,531 INFO L225 Difference]: With dead ends: 7974 [2019-10-07 15:54:37,531 INFO L226 Difference]: Without dead ends: 4363 [2019-10-07 15:54:37,546 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-07 15:54:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2019-10-07 15:54:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3801. [2019-10-07 15:54:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2019-10-07 15:54:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 4825 transitions. [2019-10-07 15:54:37,790 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 4825 transitions. Word has length 104 [2019-10-07 15:54:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 3801 states and 4825 transitions. [2019-10-07 15:54:37,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 4825 transitions. [2019-10-07 15:54:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:37,795 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:37,795 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:37,796 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -265673379, now seen corresponding path program 1 times [2019-10-07 15:54:37,796 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:37,796 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:37,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:37,797 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 15:54:37,886 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:37,887 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:37,887 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:37,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:37,888 INFO L87 Difference]: Start difference. First operand 3801 states and 4825 transitions. Second operand 4 states. [2019-10-07 15:54:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:38,112 INFO L93 Difference]: Finished difference Result 7086 states and 9072 transitions. [2019-10-07 15:54:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:38,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-07 15:54:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:38,134 INFO L225 Difference]: With dead ends: 7086 [2019-10-07 15:54:38,135 INFO L226 Difference]: Without dead ends: 3743 [2019-10-07 15:54:38,146 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2019-10-07 15:54:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3743. [2019-10-07 15:54:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-10-07 15:54:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 4651 transitions. [2019-10-07 15:54:38,358 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 4651 transitions. Word has length 106 [2019-10-07 15:54:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:38,358 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 4651 transitions. [2019-10-07 15:54:38,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 4651 transitions. [2019-10-07 15:54:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:38,363 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:38,363 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:38,363 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1486704120, now seen corresponding path program 1 times [2019-10-07 15:54:38,364 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:38,364 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:38,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:38,437 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:38,437 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:38,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:38,438 INFO L87 Difference]: Start difference. First operand 3743 states and 4651 transitions. Second operand 5 states. [2019-10-07 15:54:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:39,012 INFO L93 Difference]: Finished difference Result 11140 states and 13786 transitions. [2019-10-07 15:54:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:39,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-07 15:54:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:39,051 INFO L225 Difference]: With dead ends: 11140 [2019-10-07 15:54:39,051 INFO L226 Difference]: Without dead ends: 7947 [2019-10-07 15:54:39,062 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2019-10-07 15:54:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6284. [2019-10-07 15:54:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6284 states. [2019-10-07 15:54:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 7766 transitions. [2019-10-07 15:54:39,424 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 7766 transitions. Word has length 106 [2019-10-07 15:54:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:39,425 INFO L462 AbstractCegarLoop]: Abstraction has 6284 states and 7766 transitions. [2019-10-07 15:54:39,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 7766 transitions. [2019-10-07 15:54:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:39,429 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:39,429 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:39,429 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1288049177, now seen corresponding path program 1 times [2019-10-07 15:54:39,430 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:39,430 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,430 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,430 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:39,506 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,506 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:39,506 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:39,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:39,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:39,507 INFO L87 Difference]: Start difference. First operand 6284 states and 7766 transitions. Second operand 5 states. [2019-10-07 15:54:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:40,211 INFO L93 Difference]: Finished difference Result 14236 states and 17506 transitions. [2019-10-07 15:54:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:40,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-07 15:54:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:40,263 INFO L225 Difference]: With dead ends: 14236 [2019-10-07 15:54:40,264 INFO L226 Difference]: Without dead ends: 8719 [2019-10-07 15:54:40,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-10-07 15:54:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 8363. [2019-10-07 15:54:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8363 states. [2019-10-07 15:54:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8363 states to 8363 states and 10244 transitions. [2019-10-07 15:54:40,774 INFO L78 Accepts]: Start accepts. Automaton has 8363 states and 10244 transitions. Word has length 106 [2019-10-07 15:54:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:40,775 INFO L462 AbstractCegarLoop]: Abstraction has 8363 states and 10244 transitions. [2019-10-07 15:54:40,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8363 states and 10244 transitions. [2019-10-07 15:54:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-07 15:54:40,780 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:40,780 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:40,781 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2008197316, now seen corresponding path program 1 times [2019-10-07 15:54:40,781 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:40,781 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,781 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:40,833 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:40,834 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:40,834 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:40,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:40,835 INFO L87 Difference]: Start difference. First operand 8363 states and 10244 transitions. Second operand 3 states. [2019-10-07 15:54:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,225 INFO L93 Difference]: Finished difference Result 16004 states and 19546 transitions. [2019-10-07 15:54:41,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:41,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-07 15:54:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,256 INFO L225 Difference]: With dead ends: 16004 [2019-10-07 15:54:41,256 INFO L226 Difference]: Without dead ends: 8402 [2019-10-07 15:54:41,276 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2019-10-07 15:54:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 8369. [2019-10-07 15:54:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-10-07 15:54:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 10250 transitions. [2019-10-07 15:54:41,906 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 10250 transitions. Word has length 107 [2019-10-07 15:54:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,906 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 10250 transitions. [2019-10-07 15:54:41,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 10250 transitions. [2019-10-07 15:54:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 15:54:41,912 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,912 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:41,912 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293821, now seen corresponding path program 1 times [2019-10-07 15:54:41,913 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,913 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:42,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:42,131 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:42,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:42,133 INFO L87 Difference]: Start difference. First operand 8369 states and 10250 transitions. Second operand 9 states. [2019-10-07 15:54:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,513 INFO L93 Difference]: Finished difference Result 15928 states and 19425 transitions. [2019-10-07 15:54:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 15:54:43,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-07 15:54:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,544 INFO L225 Difference]: With dead ends: 15928 [2019-10-07 15:54:43,544 INFO L226 Difference]: Without dead ends: 7757 [2019-10-07 15:54:43,564 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-07 15:54:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2019-10-07 15:54:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 7010. [2019-10-07 15:54:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-10-07 15:54:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 8520 transitions. [2019-10-07 15:54:44,125 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 8520 transitions. Word has length 108 [2019-10-07 15:54:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:44,126 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 8520 transitions. [2019-10-07 15:54:44,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 8520 transitions. [2019-10-07 15:54:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-07 15:54:44,128 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:44,129 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:44,129 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash -114490251, now seen corresponding path program 1 times [2019-10-07 15:54:44,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:44,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:44,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:44,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:44,185 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:44,185 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:44,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:44,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:44,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:44,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:44,187 INFO L87 Difference]: Start difference. First operand 7010 states and 8520 transitions. Second operand 3 states. [2019-10-07 15:54:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:44,479 INFO L93 Difference]: Finished difference Result 13754 states and 16701 transitions. [2019-10-07 15:54:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:44,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-07 15:54:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:44,500 INFO L225 Difference]: With dead ends: 13754 [2019-10-07 15:54:44,500 INFO L226 Difference]: Without dead ends: 7052 [2019-10-07 15:54:44,513 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2019-10-07 15:54:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 7016. [2019-10-07 15:54:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-07 15:54:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8526 transitions. [2019-10-07 15:54:45,519 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8526 transitions. Word has length 109 [2019-10-07 15:54:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:45,520 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 8526 transitions. [2019-10-07 15:54:45,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8526 transitions. [2019-10-07 15:54:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-07 15:54:45,522 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:45,522 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:45,523 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 168460400, now seen corresponding path program 1 times [2019-10-07 15:54:45,523 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:45,523 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:45,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:45,524 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:45,780 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:45,780 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:45,780 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:45,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:45,786 INFO L87 Difference]: Start difference. First operand 7016 states and 8526 transitions. Second operand 9 states. [2019-10-07 15:54:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:47,310 INFO L93 Difference]: Finished difference Result 13764 states and 16698 transitions. [2019-10-07 15:54:47,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 15:54:47,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-10-07 15:54:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:47,333 INFO L225 Difference]: With dead ends: 13764 [2019-10-07 15:54:47,333 INFO L226 Difference]: Without dead ends: 7054 [2019-10-07 15:54:47,347 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:54:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-10-07 15:54:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6852. [2019-10-07 15:54:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2019-10-07 15:54:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 8312 transitions. [2019-10-07 15:54:47,815 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 8312 transitions. Word has length 109 [2019-10-07 15:54:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:47,816 INFO L462 AbstractCegarLoop]: Abstraction has 6852 states and 8312 transitions. [2019-10-07 15:54:47,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 8312 transitions. [2019-10-07 15:54:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 15:54:47,818 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:47,818 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:47,818 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -837998841, now seen corresponding path program 1 times [2019-10-07 15:54:47,819 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:47,819 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 15:54:47,873 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,873 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:47,873 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:47,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:47,874 INFO L87 Difference]: Start difference. First operand 6852 states and 8312 transitions. Second operand 4 states. [2019-10-07 15:54:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:48,315 INFO L93 Difference]: Finished difference Result 13244 states and 16021 transitions. [2019-10-07 15:54:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:48,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-07 15:54:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:48,337 INFO L225 Difference]: With dead ends: 13244 [2019-10-07 15:54:48,337 INFO L226 Difference]: Without dead ends: 6696 [2019-10-07 15:54:48,349 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-10-07 15:54:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6337. [2019-10-07 15:54:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6337 states. [2019-10-07 15:54:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 7669 transitions. [2019-10-07 15:54:48,764 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 7669 transitions. Word has length 110 [2019-10-07 15:54:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:48,764 INFO L462 AbstractCegarLoop]: Abstraction has 6337 states and 7669 transitions. [2019-10-07 15:54:48,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 7669 transitions. [2019-10-07 15:54:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 15:54:48,766 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:48,767 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:48,767 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -787219165, now seen corresponding path program 1 times [2019-10-07 15:54:48,767 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:48,768 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:48,768 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:48,768 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 15:54:48,853 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:48,853 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:48,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:48,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:48,855 INFO L87 Difference]: Start difference. First operand 6337 states and 7669 transitions. Second operand 4 states. [2019-10-07 15:54:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:49,325 INFO L93 Difference]: Finished difference Result 12271 states and 14974 transitions. [2019-10-07 15:54:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:49,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-07 15:54:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:49,350 INFO L225 Difference]: With dead ends: 12271 [2019-10-07 15:54:49,351 INFO L226 Difference]: Without dead ends: 6217 [2019-10-07 15:54:49,365 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2019-10-07 15:54:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 5839. [2019-10-07 15:54:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5839 states. [2019-10-07 15:54:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5839 states to 5839 states and 6829 transitions. [2019-10-07 15:54:49,727 INFO L78 Accepts]: Start accepts. Automaton has 5839 states and 6829 transitions. Word has length 122 [2019-10-07 15:54:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:49,728 INFO L462 AbstractCegarLoop]: Abstraction has 5839 states and 6829 transitions. [2019-10-07 15:54:49,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5839 states and 6829 transitions. [2019-10-07 15:54:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 15:54:49,730 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:49,730 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:49,731 INFO L410 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1323966023, now seen corresponding path program 1 times [2019-10-07 15:54:49,731 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:49,731 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:49,732 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,732 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 15:54:49,810 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:49,810 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:49,810 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:49,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:49,811 INFO L87 Difference]: Start difference. First operand 5839 states and 6829 transitions. Second operand 4 states. [2019-10-07 15:54:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:50,137 INFO L93 Difference]: Finished difference Result 11237 states and 13180 transitions. [2019-10-07 15:54:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:50,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-07 15:54:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:50,162 INFO L225 Difference]: With dead ends: 11237 [2019-10-07 15:54:50,162 INFO L226 Difference]: Without dead ends: 5701 [2019-10-07 15:54:50,173 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-10-07 15:54:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5297. [2019-10-07 15:54:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5297 states. [2019-10-07 15:54:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 6020 transitions. [2019-10-07 15:54:50,584 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 6020 transitions. Word has length 138 [2019-10-07 15:54:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:50,585 INFO L462 AbstractCegarLoop]: Abstraction has 5297 states and 6020 transitions. [2019-10-07 15:54:50,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 6020 transitions. [2019-10-07 15:54:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 15:54:50,587 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:50,587 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:50,588 INFO L410 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 171279942, now seen corresponding path program 1 times [2019-10-07 15:54:50,588 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:50,588 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:50,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:50,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 15:54:50,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:50,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:51,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 15:54:51,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 15:54:51,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 15:54:51,758 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:54:51,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-07 15:54:51,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:54:51,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:54:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:51,760 INFO L87 Difference]: Start difference. First operand 5297 states and 6020 transitions. Second operand 11 states. [2019-10-07 15:54:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:53,951 INFO L93 Difference]: Finished difference Result 11840 states and 13360 transitions. [2019-10-07 15:54:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:53,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2019-10-07 15:54:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:53,994 INFO L225 Difference]: With dead ends: 11840 [2019-10-07 15:54:53,994 INFO L226 Difference]: Without dead ends: 6778 [2019-10-07 15:54:54,013 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 15:54:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6778 states. [2019-10-07 15:54:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6778 to 4996. [2019-10-07 15:54:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2019-10-07 15:54:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 5610 transitions. [2019-10-07 15:54:54,545 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 5610 transitions. Word has length 150 [2019-10-07 15:54:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:54,546 INFO L462 AbstractCegarLoop]: Abstraction has 4996 states and 5610 transitions. [2019-10-07 15:54:54,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:54:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 5610 transitions. [2019-10-07 15:54:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 15:54:54,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:54,555 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:54,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:54,769 INFO L410 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1534214102, now seen corresponding path program 1 times [2019-10-07 15:54:54,770 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:54,770 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:54,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:54,771 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 15:54:54,946 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:54,946 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:55,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 15:54:55,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:55,385 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-07 15:54:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:54:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-07 15:54:55,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:56,194 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:56,375 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:57,993 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8191 disjunctions. This might take some time... [2019-10-07 15:55:01,865 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 8191 disjunctions.