/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:34:46,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:34:46,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:34:46,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:34:46,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:34:46,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:34:46,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:34:46,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:34:46,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:34:46,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:34:46,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:34:46,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:34:46,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:34:46,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:34:46,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:34:46,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:34:46,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:34:46,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:34:46,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:34:46,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:34:46,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:34:46,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:34:46,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:34:46,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:34:46,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:34:46,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:34:46,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:34:46,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:34:46,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:34:46,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:34:46,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:34:46,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:34:46,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:34:46,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:34:46,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:34:46,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:34:46,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:34:46,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:34:46,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:34:46,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:34:46,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:34:46,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:34:46,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:34:46,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:34:46,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:34:46,748 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:34:46,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:34:46,749 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:34:46,749 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:34:46,749 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:34:46,749 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:34:46,749 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:34:46,750 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:34:46,750 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:34:46,750 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:34:46,750 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:34:46,750 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:34:46,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:34:46,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:34:46,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:34:46,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:34:46,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:34:46,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:34:46,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:34:46,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:34:46,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:34:46,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:34:46,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:34:46,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:34:46,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:34:46,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:34:46,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:34:46,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:34:46,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:34:46,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:34:46,755 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:34:46,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:34:46,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:34:46,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:34:46,756 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:34:47,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:34:47,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:34:47,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:34:47,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:34:47,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:34:47,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-11-23 23:34:47,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3139aba/d5b790fe233c447da9d8e653e88034f7/FLAG981ca0d2e [2019-11-23 23:34:47,802 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:34:47,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29.c [2019-11-23 23:34:47,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3139aba/d5b790fe233c447da9d8e653e88034f7/FLAG981ca0d2e [2019-11-23 23:34:47,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3139aba/d5b790fe233c447da9d8e653e88034f7 [2019-11-23 23:34:48,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:34:48,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:34:48,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:48,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:34:48,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:34:48,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:47" (1/1) ... [2019-11-23 23:34:48,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623a7446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:48, skipping insertion in model container [2019-11-23 23:34:48,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:47" (1/1) ... [2019-11-23 23:34:48,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:34:48,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:34:49,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:49,128 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:34:49,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:49,439 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:34:49,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49 WrapperNode [2019-11-23 23:34:49,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:49,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:49,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:34:49,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:34:49,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:49,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:34:49,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:34:49,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:34:49,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (1/1) ... [2019-11-23 23:34:49,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:34:49,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:34:49,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:34:49,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:34:49,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (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-11-23 23:34:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:34:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:34:53,108 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:34:53,108 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:34:53,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:53 BoogieIcfgContainer [2019-11-23 23:34:53,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:34:53,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:34:53,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:34:53,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:34:53,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:34:47" (1/3) ... [2019-11-23 23:34:53,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:53, skipping insertion in model container [2019-11-23 23:34:53,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:49" (2/3) ... [2019-11-23 23:34:53,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:53, skipping insertion in model container [2019-11-23 23:34:53,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:53" (3/3) ... [2019-11-23 23:34:53,121 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2019-11-23 23:34:53,131 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:34:53,139 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:34:53,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:34:53,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:34:53,179 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:34:53,179 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:34:53,179 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:34:53,179 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:34:53,179 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:34:53,180 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:34:53,180 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:34:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:34:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:34:53,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:53,216 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:34:53,217 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1467444191, now seen corresponding path program 1 times [2019-11-23 23:34:53,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:53,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480689773] [2019-11-23 23:34:53,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:53,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480689773] [2019-11-23 23:34:53,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:53,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:53,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228535602] [2019-11-23 23:34:53,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:53,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:53,906 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:34:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:55,456 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:34:55,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:55,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:34:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:55,489 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:34:55,489 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:34:55,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:34:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:34:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:34:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 555 transitions. [2019-11-23 23:34:55,562 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 555 transitions. Word has length 143 [2019-11-23 23:34:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:55,563 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 555 transitions. [2019-11-23 23:34:55,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 555 transitions. [2019-11-23 23:34:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 23:34:55,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:55,568 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:34:55,568 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1495682355, now seen corresponding path program 1 times [2019-11-23 23:34:55,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:55,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383927656] [2019-11-23 23:34:55,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:55,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383927656] [2019-11-23 23:34:55,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:55,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:55,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724790014] [2019-11-23 23:34:55,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:55,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:55,709 INFO L87 Difference]: Start difference. First operand 289 states and 555 transitions. Second operand 3 states. [2019-11-23 23:34:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:56,685 INFO L93 Difference]: Finished difference Result 865 states and 1663 transitions. [2019-11-23 23:34:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:56,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 23:34:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:56,690 INFO L225 Difference]: With dead ends: 865 [2019-11-23 23:34:56,690 INFO L226 Difference]: Without dead ends: 577 [2019-11-23 23:34:56,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:34:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-23 23:34:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-11-23 23:34:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:34:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1023 transitions. [2019-11-23 23:34:56,731 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1023 transitions. Word has length 147 [2019-11-23 23:34:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:56,731 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1023 transitions. [2019-11-23 23:34:56,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1023 transitions. [2019-11-23 23:34:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:34:56,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:56,736 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:34:56,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 732724931, now seen corresponding path program 1 times [2019-11-23 23:34:56,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157379903] [2019-11-23 23:34:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:56,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157379903] [2019-11-23 23:34:56,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:56,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:56,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900860439] [2019-11-23 23:34:56,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:56,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:56,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:56,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:56,823 INFO L87 Difference]: Start difference. First operand 575 states and 1023 transitions. Second operand 4 states. [2019-11-23 23:34:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:58,360 INFO L93 Difference]: Finished difference Result 2295 states and 4088 transitions. [2019-11-23 23:34:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:58,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:34:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:58,369 INFO L225 Difference]: With dead ends: 2295 [2019-11-23 23:34:58,370 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:34:58,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:34:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-11-23 23:34:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:34:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1900 transitions. [2019-11-23 23:34:58,416 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1900 transitions. Word has length 148 [2019-11-23 23:34:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:58,416 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1900 transitions. [2019-11-23 23:34:58,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1900 transitions. [2019-11-23 23:34:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:34:58,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:58,422 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:34:58,422 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1977871168, now seen corresponding path program 1 times [2019-11-23 23:34:58,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:58,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894564273] [2019-11-23 23:34:58,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:58,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894564273] [2019-11-23 23:34:58,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:58,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:58,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006261377] [2019-11-23 23:34:58,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:58,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:58,522 INFO L87 Difference]: Start difference. First operand 1147 states and 1900 transitions. Second operand 3 states. [2019-11-23 23:34:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:59,370 INFO L93 Difference]: Finished difference Result 3437 states and 5697 transitions. [2019-11-23 23:34:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:59,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:34:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:59,383 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:34:59,383 INFO L226 Difference]: Without dead ends: 2291 [2019-11-23 23:34:59,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:34:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-23 23:34:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-11-23 23:34:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-11-23 23:34:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3712 transitions. [2019-11-23 23:34:59,437 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3712 transitions. Word has length 151 [2019-11-23 23:34:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:59,438 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3712 transitions. [2019-11-23 23:34:59,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3712 transitions. [2019-11-23 23:34:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:34:59,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:59,444 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:59,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1384665577, now seen corresponding path program 1 times [2019-11-23 23:34:59,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:59,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933058377] [2019-11-23 23:34:59,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 23:34:59,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933058377] [2019-11-23 23:34:59,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:59,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:59,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251613195] [2019-11-23 23:34:59,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:59,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:59,514 INFO L87 Difference]: Start difference. First operand 2291 states and 3712 transitions. Second operand 3 states. [2019-11-23 23:35:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:00,431 INFO L93 Difference]: Finished difference Result 5439 states and 8756 transitions. [2019-11-23 23:35:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:00,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:35:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:00,448 INFO L225 Difference]: With dead ends: 5439 [2019-11-23 23:35:00,448 INFO L226 Difference]: Without dead ends: 3149 [2019-11-23 23:35:00,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:35:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-11-23 23:35:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2019-11-23 23:35:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2019-11-23 23:35:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4933 transitions. [2019-11-23 23:35:00,513 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4933 transitions. Word has length 158 [2019-11-23 23:35:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:00,513 INFO L462 AbstractCegarLoop]: Abstraction has 3149 states and 4933 transitions. [2019-11-23 23:35:00,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4933 transitions. [2019-11-23 23:35:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 23:35:00,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:00,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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-11-23 23:35:00,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:00,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1834121952, now seen corresponding path program 1 times [2019-11-23 23:35:00,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:00,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500681714] [2019-11-23 23:35:00,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:00,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500681714] [2019-11-23 23:35:00,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:00,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:00,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915338845] [2019-11-23 23:35:00,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:00,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:00,616 INFO L87 Difference]: Start difference. First operand 3149 states and 4933 transitions. Second operand 4 states. [2019-11-23 23:35:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:02,092 INFO L93 Difference]: Finished difference Result 11302 states and 17616 transitions. [2019-11-23 23:35:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 23:35:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:02,130 INFO L225 Difference]: With dead ends: 11302 [2019-11-23 23:35:02,131 INFO L226 Difference]: Without dead ends: 8154 [2019-11-23 23:35:02,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states. [2019-11-23 23:35:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 8154. [2019-11-23 23:35:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-11-23 23:35:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 10769 transitions. [2019-11-23 23:35:02,346 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 10769 transitions. Word has length 162 [2019-11-23 23:35:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:02,346 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 10769 transitions. [2019-11-23 23:35:02,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 10769 transitions. [2019-11-23 23:35:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:35:02,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:02,366 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:02,367 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1690901083, now seen corresponding path program 1 times [2019-11-23 23:35:02,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:02,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366432910] [2019-11-23 23:35:02,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:02,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366432910] [2019-11-23 23:35:02,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:02,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:02,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173246596] [2019-11-23 23:35:02,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:02,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:02,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:02,600 INFO L87 Difference]: Start difference. First operand 8154 states and 10769 transitions. Second operand 5 states. [2019-11-23 23:35:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:04,575 INFO L93 Difference]: Finished difference Result 25892 states and 34435 transitions. [2019-11-23 23:35:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:35:04,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:35:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:04,647 INFO L225 Difference]: With dead ends: 25892 [2019-11-23 23:35:04,648 INFO L226 Difference]: Without dead ends: 17739 [2019-11-23 23:35:04,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17739 states. [2019-11-23 23:35:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17739 to 17306. [2019-11-23 23:35:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17306 states. [2019-11-23 23:35:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17306 states to 17306 states and 22824 transitions. [2019-11-23 23:35:05,184 INFO L78 Accepts]: Start accepts. Automaton has 17306 states and 22824 transitions. Word has length 181 [2019-11-23 23:35:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:05,186 INFO L462 AbstractCegarLoop]: Abstraction has 17306 states and 22824 transitions. [2019-11-23 23:35:05,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 17306 states and 22824 transitions. [2019-11-23 23:35:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-23 23:35:05,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:05,215 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:05,215 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash -854046145, now seen corresponding path program 1 times [2019-11-23 23:35:05,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:05,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890602450] [2019-11-23 23:35:05,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 23:35:05,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890602450] [2019-11-23 23:35:05,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:05,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:05,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639442398] [2019-11-23 23:35:05,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:05,296 INFO L87 Difference]: Start difference. First operand 17306 states and 22824 transitions. Second operand 3 states. [2019-11-23 23:35:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:06,392 INFO L93 Difference]: Finished difference Result 41189 states and 54652 transitions. [2019-11-23 23:35:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:06,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-23 23:35:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:06,437 INFO L225 Difference]: With dead ends: 41189 [2019-11-23 23:35:06,437 INFO L226 Difference]: Without dead ends: 23884 [2019-11-23 23:35:06,459 INFO L630 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-11-23 23:35:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23884 states. [2019-11-23 23:35:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23884 to 23741. [2019-11-23 23:35:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23741 states. [2019-11-23 23:35:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23741 states to 23741 states and 30372 transitions. [2019-11-23 23:35:07,561 INFO L78 Accepts]: Start accepts. Automaton has 23741 states and 30372 transitions. Word has length 211 [2019-11-23 23:35:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:07,562 INFO L462 AbstractCegarLoop]: Abstraction has 23741 states and 30372 transitions. [2019-11-23 23:35:07,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23741 states and 30372 transitions. [2019-11-23 23:35:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 23:35:07,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:07,600 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:07,601 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1266274654, now seen corresponding path program 1 times [2019-11-23 23:35:07,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:07,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501798947] [2019-11-23 23:35:07,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 23:35:07,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501798947] [2019-11-23 23:35:07,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:07,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:07,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259916415] [2019-11-23 23:35:07,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:07,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:07,743 INFO L87 Difference]: Start difference. First operand 23741 states and 30372 transitions. Second operand 4 states. [2019-11-23 23:35:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:09,586 INFO L93 Difference]: Finished difference Result 83664 states and 106337 transitions. [2019-11-23 23:35:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:09,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-23 23:35:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:09,669 INFO L225 Difference]: With dead ends: 83664 [2019-11-23 23:35:09,670 INFO L226 Difference]: Without dead ends: 59924 [2019-11-23 23:35:09,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59924 states. [2019-11-23 23:35:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59924 to 59920. [2019-11-23 23:35:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59920 states. [2019-11-23 23:35:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59920 states to 59920 states and 74552 transitions. [2019-11-23 23:35:10,797 INFO L78 Accepts]: Start accepts. Automaton has 59920 states and 74552 transitions. Word has length 244 [2019-11-23 23:35:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:10,798 INFO L462 AbstractCegarLoop]: Abstraction has 59920 states and 74552 transitions. [2019-11-23 23:35:10,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 59920 states and 74552 transitions. [2019-11-23 23:35:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 23:35:10,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:10,822 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:10,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929837, now seen corresponding path program 1 times [2019-11-23 23:35:10,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:10,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890068534] [2019-11-23 23:35:10,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:35:10,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890068534] [2019-11-23 23:35:10,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:10,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:10,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798266250] [2019-11-23 23:35:10,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:10,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:10,939 INFO L87 Difference]: Start difference. First operand 59920 states and 74552 transitions. Second operand 3 states. [2019-11-23 23:35:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:13,098 INFO L93 Difference]: Finished difference Result 151156 states and 187076 transitions. [2019-11-23 23:35:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:13,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-23 23:35:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:13,219 INFO L225 Difference]: With dead ends: 151156 [2019-11-23 23:35:13,219 INFO L226 Difference]: Without dead ends: 91237 [2019-11-23 23:35:13,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:35:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91237 states. [2019-11-23 23:35:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91237 to 91237. [2019-11-23 23:35:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91237 states. [2019-11-23 23:35:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91237 states to 91237 states and 112257 transitions. [2019-11-23 23:35:14,378 INFO L78 Accepts]: Start accepts. Automaton has 91237 states and 112257 transitions. Word has length 245 [2019-11-23 23:35:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:14,378 INFO L462 AbstractCegarLoop]: Abstraction has 91237 states and 112257 transitions. [2019-11-23 23:35:14,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 91237 states and 112257 transitions. [2019-11-23 23:35:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 23:35:14,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:14,401 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:14,401 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1387578096, now seen corresponding path program 1 times [2019-11-23 23:35:14,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:14,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114298199] [2019-11-23 23:35:14,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:35:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114298199] [2019-11-23 23:35:14,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905613549] [2019-11-23 23:35:14,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:15,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:15,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:15,242 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:15,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:15,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:15,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848894611] [2019-11-23 23:35:15,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:15,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:15,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:15,317 INFO L87 Difference]: Start difference. First operand 91237 states and 112257 transitions. Second operand 3 states. [2019-11-23 23:35:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:16,618 INFO L93 Difference]: Finished difference Result 216650 states and 265033 transitions. [2019-11-23 23:35:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:16,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 23:35:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:18,587 INFO L225 Difference]: With dead ends: 216650 [2019-11-23 23:35:18,587 INFO L226 Difference]: Without dead ends: 125414 [2019-11-23 23:35:18,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125414 states. [2019-11-23 23:35:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125414 to 110828. [2019-11-23 23:35:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110828 states. [2019-11-23 23:35:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110828 states to 110828 states and 131915 transitions. [2019-11-23 23:35:19,885 INFO L78 Accepts]: Start accepts. Automaton has 110828 states and 131915 transitions. Word has length 252 [2019-11-23 23:35:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:19,885 INFO L462 AbstractCegarLoop]: Abstraction has 110828 states and 131915 transitions. [2019-11-23 23:35:19,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 110828 states and 131915 transitions. [2019-11-23 23:35:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:35:19,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:19,902 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:20,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:20,109 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1289246352, now seen corresponding path program 1 times [2019-11-23 23:35:20,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:20,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623049418] [2019-11-23 23:35:20,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:20,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623049418] [2019-11-23 23:35:20,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:20,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:20,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566088076] [2019-11-23 23:35:20,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:20,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:20,406 INFO L87 Difference]: Start difference. First operand 110828 states and 131915 transitions. Second operand 3 states. [2019-11-23 23:35:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:22,127 INFO L93 Difference]: Finished difference Result 243677 states and 291441 transitions. [2019-11-23 23:35:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:22,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-23 23:35:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:22,265 INFO L225 Difference]: With dead ends: 243677 [2019-11-23 23:35:22,265 INFO L226 Difference]: Without dead ends: 132850 [2019-11-23 23:35:22,316 INFO L630 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-11-23 23:35:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132850 states. [2019-11-23 23:35:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132850 to 120266. [2019-11-23 23:35:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120266 states. [2019-11-23 23:35:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120266 states to 120266 states and 143781 transitions. [2019-11-23 23:35:24,148 INFO L78 Accepts]: Start accepts. Automaton has 120266 states and 143781 transitions. Word has length 271 [2019-11-23 23:35:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:24,148 INFO L462 AbstractCegarLoop]: Abstraction has 120266 states and 143781 transitions. [2019-11-23 23:35:24,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 120266 states and 143781 transitions. [2019-11-23 23:35:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-23 23:35:24,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:24,172 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:24,172 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278364, now seen corresponding path program 1 times [2019-11-23 23:35:24,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:24,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415819726] [2019-11-23 23:35:24,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:24,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415819726] [2019-11-23 23:35:24,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908483361] [2019-11-23 23:35:24,914 INFO L94 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-11-23 23:35:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:25,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:35:25,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:25,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:25,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:25,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:25,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713266145] [2019-11-23 23:35:25,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:25,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:25,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:25,292 INFO L87 Difference]: Start difference. First operand 120266 states and 143781 transitions. Second operand 4 states. [2019-11-23 23:35:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:29,151 INFO L93 Difference]: Finished difference Result 335056 states and 401710 transitions. [2019-11-23 23:35:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:29,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-23 23:35:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:29,533 INFO L225 Difference]: With dead ends: 335056 [2019-11-23 23:35:29,534 INFO L226 Difference]: Without dead ends: 214791 [2019-11-23 23:35:29,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214791 states. [2019-11-23 23:35:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214791 to 194340. [2019-11-23 23:35:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194340 states. [2019-11-23 23:35:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194340 states to 194340 states and 233225 transitions. [2019-11-23 23:35:36,080 INFO L78 Accepts]: Start accepts. Automaton has 194340 states and 233225 transitions. Word has length 302 [2019-11-23 23:35:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:36,080 INFO L462 AbstractCegarLoop]: Abstraction has 194340 states and 233225 transitions. [2019-11-23 23:35:36,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 194340 states and 233225 transitions. [2019-11-23 23:35:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-23 23:35:36,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:36,153 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:36,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:36,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1707400909, now seen corresponding path program 1 times [2019-11-23 23:35:36,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:36,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668479764] [2019-11-23 23:35:36,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:35:36,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668479764] [2019-11-23 23:35:36,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:36,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:36,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039247428] [2019-11-23 23:35:36,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:36,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:36,654 INFO L87 Difference]: Start difference. First operand 194340 states and 233225 transitions. Second operand 4 states. [2019-11-23 23:35:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:39,449 INFO L93 Difference]: Finished difference Result 393114 states and 472311 transitions. [2019-11-23 23:35:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:39,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-11-23 23:35:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:40,481 INFO L225 Difference]: With dead ends: 393114 [2019-11-23 23:35:40,482 INFO L226 Difference]: Without dead ends: 198775 [2019-11-23 23:35:40,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198775 states. [2019-11-23 23:35:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198775 to 196485. [2019-11-23 23:35:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196485 states. [2019-11-23 23:35:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196485 states to 196485 states and 233955 transitions. [2019-11-23 23:35:45,738 INFO L78 Accepts]: Start accepts. Automaton has 196485 states and 233955 transitions. Word has length 334 [2019-11-23 23:35:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:45,738 INFO L462 AbstractCegarLoop]: Abstraction has 196485 states and 233955 transitions. [2019-11-23 23:35:45,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 196485 states and 233955 transitions. [2019-11-23 23:35:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-23 23:35:45,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:45,774 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:45,774 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1881836525, now seen corresponding path program 1 times [2019-11-23 23:35:45,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:45,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666470118] [2019-11-23 23:35:45,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 23:35:45,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666470118] [2019-11-23 23:35:45,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:45,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:45,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983181674] [2019-11-23 23:35:45,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:45,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:45,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:45,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:45,970 INFO L87 Difference]: Start difference. First operand 196485 states and 233955 transitions. Second operand 4 states. [2019-11-23 23:35:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:48,821 INFO L93 Difference]: Finished difference Result 398832 states and 475238 transitions. [2019-11-23 23:35:48,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:48,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-11-23 23:35:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:49,045 INFO L225 Difference]: With dead ends: 398832 [2019-11-23 23:35:49,045 INFO L226 Difference]: Without dead ends: 202348 [2019-11-23 23:35:49,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202348 states. [2019-11-23 23:35:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202348 to 197629. [2019-11-23 23:35:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197629 states. [2019-11-23 23:35:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197629 states to 197629 states and 232669 transitions. [2019-11-23 23:35:51,947 INFO L78 Accepts]: Start accepts. Automaton has 197629 states and 232669 transitions. Word has length 335 [2019-11-23 23:35:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:51,948 INFO L462 AbstractCegarLoop]: Abstraction has 197629 states and 232669 transitions. [2019-11-23 23:35:51,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 197629 states and 232669 transitions. [2019-11-23 23:35:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-23 23:35:51,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:51,973 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:35:51,973 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1495429998, now seen corresponding path program 1 times [2019-11-23 23:35:51,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:51,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154197946] [2019-11-23 23:35:51,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-23 23:35:52,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154197946] [2019-11-23 23:35:52,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:52,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:52,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648768718] [2019-11-23 23:35:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:52,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:52,130 INFO L87 Difference]: Start difference. First operand 197629 states and 232669 transitions. Second operand 4 states. [2019-11-23 23:35:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:57,485 INFO L93 Difference]: Finished difference Result 565858 states and 661400 transitions. [2019-11-23 23:35:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:57,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-23 23:35:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:57,878 INFO L225 Difference]: With dead ends: 565858 [2019-11-23 23:35:57,878 INFO L226 Difference]: Without dead ends: 368230