/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:53,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:53,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:53,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:53,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:53,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:53,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:53,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:53,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:53,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:53,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:53,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:53,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:53,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:53,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:53,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:53,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:53,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:53,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:53,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:53,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:53,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:53,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:53,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:53,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:53,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:53,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:53,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:53,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:53,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:53,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:53,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:53,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:53,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:53,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:53,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:53,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:53,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:53,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:53,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:53,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:53,690 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:35:53,710 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:53,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:53,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:53,712 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:53,712 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:53,713 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:53,713 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:53,713 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:53,713 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:53,713 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:53,714 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:53,715 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:53,715 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:53,715 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:53,715 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:53,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:53,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:53,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:53,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:53,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:53,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:53,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:53,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:53,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:53,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:53,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:53,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:53,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:53,721 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:53,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:53,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:53,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:53,722 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:35:54,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:35:54,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:35:54,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:35:54,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:35:54,027 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:35:54,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label45.c [2019-11-23 23:35:54,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b37b6a7/3edf413a234d431880e410f9883fd298/FLAG41747de97 [2019-11-23 23:35:54,761 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:54,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label45.c [2019-11-23 23:35:54,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b37b6a7/3edf413a234d431880e410f9883fd298/FLAG41747de97 [2019-11-23 23:35:54,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93b37b6a7/3edf413a234d431880e410f9883fd298 [2019-11-23 23:35:54,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:54,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:54,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:54,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:54,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:54,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:54" (1/1) ... [2019-11-23 23:35:54,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e21359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:54, skipping insertion in model container [2019-11-23 23:35:54,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:54" (1/1) ... [2019-11-23 23:35:54,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:55,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:55,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:55,890 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:56,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:56,283 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:56,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56 WrapperNode [2019-11-23 23:35:56,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:56,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:56,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:56,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:56,294 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:35:56" (1/1) ... [2019-11-23 23:35:56,334 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:35:56" (1/1) ... [2019-11-23 23:35:56,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:56,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:56,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:56,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:56,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (1/1) ... [2019-11-23 23:35:56,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:56,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:56,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:56,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:56,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (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:35:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:59,737 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:59,738 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:59,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:59 BoogieIcfgContainer [2019-11-23 23:35:59,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:59,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:59,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:59,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:59,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:54" (1/3) ... [2019-11-23 23:35:59,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6e244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:59, skipping insertion in model container [2019-11-23 23:35:59,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:56" (2/3) ... [2019-11-23 23:35:59,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6e244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:59, skipping insertion in model container [2019-11-23 23:35:59,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:59" (3/3) ... [2019-11-23 23:35:59,748 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label45.c [2019-11-23 23:35:59,758 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:59,765 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:59,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:59,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:59,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:59,803 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:59,803 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:59,803 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:59,803 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:59,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:59,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:59,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:59,836 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:35:59,837 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1468152503, now seen corresponding path program 1 times [2019-11-23 23:35:59,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:59,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175812280] [2019-11-23 23:35:59,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:00,464 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:36:00,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175812280] [2019-11-23 23:36:00,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:00,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388130226] [2019-11-23 23:36:00,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:00,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:00,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:00,492 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:36:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:02,147 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:36:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:02,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:36:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:02,168 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:36:02,168 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:36:02,172 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:36:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:36:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:36:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:36:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 520 transitions. [2019-11-23 23:36:02,247 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 520 transitions. Word has length 143 [2019-11-23 23:36:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:02,249 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 520 transitions. [2019-11-23 23:36:02,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 520 transitions. [2019-11-23 23:36:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:36:02,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:02,261 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:36:02,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 732016619, now seen corresponding path program 1 times [2019-11-23 23:36:02,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:02,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988336587] [2019-11-23 23:36:02,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:02,396 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:36:02,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988336587] [2019-11-23 23:36:02,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:02,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:02,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726516838] [2019-11-23 23:36:02,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:02,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:02,400 INFO L87 Difference]: Start difference. First operand 289 states and 520 transitions. Second operand 4 states. [2019-11-23 23:36:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:03,999 INFO L93 Difference]: Finished difference Result 1151 states and 2076 transitions. [2019-11-23 23:36:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:04,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:36:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:04,007 INFO L225 Difference]: With dead ends: 1151 [2019-11-23 23:36:04,008 INFO L226 Difference]: Without dead ends: 863 [2019-11-23 23:36:04,010 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:36:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-11-23 23:36:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 575. [2019-11-23 23:36:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:36:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 966 transitions. [2019-11-23 23:36:04,050 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 966 transitions. Word has length 148 [2019-11-23 23:36:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:04,051 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 966 transitions. [2019-11-23 23:36:04,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 966 transitions. [2019-11-23 23:36:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:36:04,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:04,056 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:36:04,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1978579480, now seen corresponding path program 1 times [2019-11-23 23:36:04,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:04,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864082903] [2019-11-23 23:36:04,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:04,152 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:36:04,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864082903] [2019-11-23 23:36:04,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:04,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:04,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77821259] [2019-11-23 23:36:04,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:04,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:04,155 INFO L87 Difference]: Start difference. First operand 575 states and 966 transitions. Second operand 3 states. [2019-11-23 23:36:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:05,118 INFO L93 Difference]: Finished difference Result 1721 states and 2895 transitions. [2019-11-23 23:36:05,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:05,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:36:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:05,126 INFO L225 Difference]: With dead ends: 1721 [2019-11-23 23:36:05,127 INFO L226 Difference]: Without dead ends: 1147 [2019-11-23 23:36:05,129 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:36:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-11-23 23:36:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2019-11-23 23:36:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:36:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1879 transitions. [2019-11-23 23:36:05,185 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1879 transitions. Word has length 151 [2019-11-23 23:36:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:05,185 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1879 transitions. [2019-11-23 23:36:05,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1879 transitions. [2019-11-23 23:36:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:36:05,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:05,196 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:36:05,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1383957265, now seen corresponding path program 1 times [2019-11-23 23:36:05,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:05,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956468710] [2019-11-23 23:36:05,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:05,324 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:36:05,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956468710] [2019-11-23 23:36:05,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:05,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:05,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635406866] [2019-11-23 23:36:05,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:05,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:05,330 INFO L87 Difference]: Start difference. First operand 1147 states and 1879 transitions. Second operand 3 states. [2019-11-23 23:36:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:06,375 INFO L93 Difference]: Finished difference Result 2865 states and 4670 transitions. [2019-11-23 23:36:06,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:06,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:36:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:06,384 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:36:06,384 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:36:06,387 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:36:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:36:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:36:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:36:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2736 transitions. [2019-11-23 23:36:06,436 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2736 transitions. Word has length 158 [2019-11-23 23:36:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:06,436 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2736 transitions. [2019-11-23 23:36:06,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2736 transitions. [2019-11-23 23:36:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:36:06,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:06,443 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2019-11-23 23:36:06,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash 558335375, now seen corresponding path program 1 times [2019-11-23 23:36:06,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:06,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906128618] [2019-11-23 23:36:06,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:36:06,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906128618] [2019-11-23 23:36:06,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:06,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:06,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203951173] [2019-11-23 23:36:06,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:06,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:06,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:06,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:06,552 INFO L87 Difference]: Start difference. First operand 1719 states and 2736 transitions. Second operand 3 states. [2019-11-23 23:36:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:06,991 INFO L93 Difference]: Finished difference Result 5155 states and 8206 transitions. [2019-11-23 23:36:06,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:06,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:36:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:07,011 INFO L225 Difference]: With dead ends: 5155 [2019-11-23 23:36:07,011 INFO L226 Difference]: Without dead ends: 3437 [2019-11-23 23:36:07,015 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:36:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-11-23 23:36:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3435. [2019-11-23 23:36:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:36:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5452 transitions. [2019-11-23 23:36:07,100 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5452 transitions. Word has length 163 [2019-11-23 23:36:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:07,100 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5452 transitions. [2019-11-23 23:36:07,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5452 transitions. [2019-11-23 23:36:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 23:36:07,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:07,109 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-11-23 23:36:07,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash -272934347, now seen corresponding path program 1 times [2019-11-23 23:36:07,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:07,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249519557] [2019-11-23 23:36:07,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 23:36:07,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249519557] [2019-11-23 23:36:07,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245113817] [2019-11-23 23:36:07,231 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:36:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:07,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:36:07,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:36:07,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:36:07,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:07,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:36:07,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871087651] [2019-11-23 23:36:07,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:07,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:07,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:07,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:07,523 INFO L87 Difference]: Start difference. First operand 3435 states and 5452 transitions. Second operand 3 states. [2019-11-23 23:36:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:07,920 INFO L93 Difference]: Finished difference Result 10303 states and 16354 transitions. [2019-11-23 23:36:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:07,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 23:36:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:07,965 INFO L225 Difference]: With dead ends: 10303 [2019-11-23 23:36:07,965 INFO L226 Difference]: Without dead ends: 6869 [2019-11-23 23:36:07,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2019-11-23 23:36:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6867. [2019-11-23 23:36:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6867 states. [2019-11-23 23:36:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 10872 transitions. [2019-11-23 23:36:08,164 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 10872 transitions. Word has length 172 [2019-11-23 23:36:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:08,165 INFO L462 AbstractCegarLoop]: Abstraction has 6867 states and 10872 transitions. [2019-11-23 23:36:08,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 10872 transitions. [2019-11-23 23:36:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:36:08,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:08,179 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:36:08,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:08,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1691609395, now seen corresponding path program 1 times [2019-11-23 23:36:08,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:08,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336887349] [2019-11-23 23:36:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:08,735 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:36:08,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336887349] [2019-11-23 23:36:08,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:08,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:08,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69143105] [2019-11-23 23:36:08,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:08,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:08,741 INFO L87 Difference]: Start difference. First operand 6867 states and 10872 transitions. Second operand 5 states. [2019-11-23 23:36:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:10,539 INFO L93 Difference]: Finished difference Result 15739 states and 25157 transitions. [2019-11-23 23:36:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:36:10,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:36:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:10,581 INFO L225 Difference]: With dead ends: 15739 [2019-11-23 23:36:10,581 INFO L226 Difference]: Without dead ends: 8873 [2019-11-23 23:36:10,592 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:36:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-11-23 23:36:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 8011. [2019-11-23 23:36:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:36:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 12674 transitions. [2019-11-23 23:36:10,770 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 12674 transitions. Word has length 181 [2019-11-23 23:36:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:10,771 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 12674 transitions. [2019-11-23 23:36:10,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 12674 transitions. [2019-11-23 23:36:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:36:10,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:10,785 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 23:36:10,786 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 141715554, now seen corresponding path program 1 times [2019-11-23 23:36:10,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230518202] [2019-11-23 23:36:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:10,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230518202] [2019-11-23 23:36:10,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:10,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:10,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197284550] [2019-11-23 23:36:10,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:10,959 INFO L87 Difference]: Start difference. First operand 8011 states and 12674 transitions. Second operand 3 states. [2019-11-23 23:36:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:12,043 INFO L93 Difference]: Finished difference Result 19882 states and 31822 transitions. [2019-11-23 23:36:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:12,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 23:36:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:12,076 INFO L225 Difference]: With dead ends: 19882 [2019-11-23 23:36:12,076 INFO L226 Difference]: Without dead ends: 11872 [2019-11-23 23:36:12,088 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:36:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2019-11-23 23:36:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 11872. [2019-11-23 23:36:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11872 states. [2019-11-23 23:36:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 18363 transitions. [2019-11-23 23:36:12,304 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 18363 transitions. Word has length 181 [2019-11-23 23:36:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:12,306 INFO L462 AbstractCegarLoop]: Abstraction has 11872 states and 18363 transitions. [2019-11-23 23:36:12,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 18363 transitions. [2019-11-23 23:36:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:36:12,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:12,328 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,329 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1289721589, now seen corresponding path program 1 times [2019-11-23 23:36:12,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973882401] [2019-11-23 23:36:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 23:36:12,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973882401] [2019-11-23 23:36:12,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:12,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:12,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739960232] [2019-11-23 23:36:12,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:12,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:12,541 INFO L87 Difference]: Start difference. First operand 11872 states and 18363 transitions. Second operand 4 states. [2019-11-23 23:36:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:14,052 INFO L93 Difference]: Finished difference Result 37187 states and 57010 transitions. [2019-11-23 23:36:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:14,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-23 23:36:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:14,124 INFO L225 Difference]: With dead ends: 37187 [2019-11-23 23:36:14,127 INFO L226 Difference]: Without dead ends: 25316 [2019-11-23 23:36:14,147 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:36:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25316 states. [2019-11-23 23:36:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25316 to 19022. [2019-11-23 23:36:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19022 states. [2019-11-23 23:36:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19022 states to 19022 states and 28108 transitions. [2019-11-23 23:36:14,613 INFO L78 Accepts]: Start accepts. Automaton has 19022 states and 28108 transitions. Word has length 181 [2019-11-23 23:36:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:14,614 INFO L462 AbstractCegarLoop]: Abstraction has 19022 states and 28108 transitions. [2019-11-23 23:36:14,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19022 states and 28108 transitions. [2019-11-23 23:36:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 23:36:14,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:14,649 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:36:14,650 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:14,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:14,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1271415744, now seen corresponding path program 1 times [2019-11-23 23:36:14,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:14,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164682379] [2019-11-23 23:36:14,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:14,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164682379] [2019-11-23 23:36:14,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:14,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:14,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710757175] [2019-11-23 23:36:14,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:14,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:14,992 INFO L87 Difference]: Start difference. First operand 19022 states and 28108 transitions. Second operand 4 states. [2019-11-23 23:36:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:16,714 INFO L93 Difference]: Finished difference Result 58921 states and 85576 transitions. [2019-11-23 23:36:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:16,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-23 23:36:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:16,793 INFO L225 Difference]: With dead ends: 58921 [2019-11-23 23:36:16,794 INFO L226 Difference]: Without dead ends: 39900 [2019-11-23 23:36:16,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:36:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39900 states. [2019-11-23 23:36:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39900 to 38184. [2019-11-23 23:36:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38184 states. [2019-11-23 23:36:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38184 states to 38184 states and 48355 transitions. [2019-11-23 23:36:18,328 INFO L78 Accepts]: Start accepts. Automaton has 38184 states and 48355 transitions. Word has length 198 [2019-11-23 23:36:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:18,328 INFO L462 AbstractCegarLoop]: Abstraction has 38184 states and 48355 transitions. [2019-11-23 23:36:18,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38184 states and 48355 transitions. [2019-11-23 23:36:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 23:36:18,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:18,377 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:36:18,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 190109374, now seen corresponding path program 1 times [2019-11-23 23:36:18,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:18,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192680599] [2019-11-23 23:36:18,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 95 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 23:36:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192680599] [2019-11-23 23:36:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200356972] [2019-11-23 23:36:18,523 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:36:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:18,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:18,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-23 23:36:18,780 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-23 23:36:18,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:18,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-11-23 23:36:18,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646449281] [2019-11-23 23:36:18,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:18,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:18,843 INFO L87 Difference]: Start difference. First operand 38184 states and 48355 transitions. Second operand 3 states. [2019-11-23 23:36:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:19,706 INFO L93 Difference]: Finished difference Result 73793 states and 93331 transitions. [2019-11-23 23:36:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:19,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 23:36:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:19,768 INFO L225 Difference]: With dead ends: 73793 [2019-11-23 23:36:19,769 INFO L226 Difference]: Without dead ends: 35610 [2019-11-23 23:36:19,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 452 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:36:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35610 states. [2019-11-23 23:36:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35610 to 35610. [2019-11-23 23:36:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35610 states. [2019-11-23 23:36:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35610 states to 35610 states and 44326 transitions. [2019-11-23 23:36:20,337 INFO L78 Accepts]: Start accepts. Automaton has 35610 states and 44326 transitions. Word has length 227 [2019-11-23 23:36:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:20,338 INFO L462 AbstractCegarLoop]: Abstraction has 35610 states and 44326 transitions. [2019-11-23 23:36:20,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35610 states and 44326 transitions. [2019-11-23 23:36:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 23:36:20,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:20,382 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:36:20,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:20,588 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 679057607, now seen corresponding path program 1 times [2019-11-23 23:36:20,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:20,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599583897] [2019-11-23 23:36:20,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 23:36:20,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599583897] [2019-11-23 23:36:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424951794] [2019-11-23 23:36:20,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:20,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:20,843 INFO L87 Difference]: Start difference. First operand 35610 states and 44326 transitions. Second operand 4 states. [2019-11-23 23:36:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:22,723 INFO L93 Difference]: Finished difference Result 93527 states and 115745 transitions. [2019-11-23 23:36:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:22,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-11-23 23:36:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:22,795 INFO L225 Difference]: With dead ends: 93527 [2019-11-23 23:36:22,795 INFO L226 Difference]: Without dead ends: 57918 [2019-11-23 23:36:22,824 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:36:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57918 states. [2019-11-23 23:36:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57918 to 46478. [2019-11-23 23:36:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46478 states. [2019-11-23 23:36:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46478 states to 46478 states and 57447 transitions. [2019-11-23 23:36:24,521 INFO L78 Accepts]: Start accepts. Automaton has 46478 states and 57447 transitions. Word has length 241 [2019-11-23 23:36:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:24,522 INFO L462 AbstractCegarLoop]: Abstraction has 46478 states and 57447 transitions. [2019-11-23 23:36:24,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 46478 states and 57447 transitions. [2019-11-23 23:36:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-23 23:36:24,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:24,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,535 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1360773304, now seen corresponding path program 1 times [2019-11-23 23:36:24,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:24,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593150662] [2019-11-23 23:36:24,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 23:36:24,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593150662] [2019-11-23 23:36:24,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768013358] [2019-11-23 23:36:24,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:24,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:36:24,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 23:36:24,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:36:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 23:36:24,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:24,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653363613] [2019-11-23 23:36:24,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:24,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:36:24,981 INFO L87 Difference]: Start difference. First operand 46478 states and 57447 transitions. Second operand 4 states. [2019-11-23 23:36:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:26,597 INFO L93 Difference]: Finished difference Result 134427 states and 166028 transitions. [2019-11-23 23:36:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:26,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2019-11-23 23:36:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:26,732 INFO L225 Difference]: With dead ends: 134427 [2019-11-23 23:36:26,733 INFO L226 Difference]: Without dead ends: 87950 [2019-11-23 23:36:26,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 494 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:36:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87950 states. [2019-11-23 23:36:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87950 to 87948. [2019-11-23 23:36:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87948 states. [2019-11-23 23:36:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87948 states to 87948 states and 108365 transitions. [2019-11-23 23:36:29,498 INFO L78 Accepts]: Start accepts. Automaton has 87948 states and 108365 transitions. Word has length 249 [2019-11-23 23:36:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:29,498 INFO L462 AbstractCegarLoop]: Abstraction has 87948 states and 108365 transitions. [2019-11-23 23:36:29,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 87948 states and 108365 transitions. [2019-11-23 23:36:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:36:29,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:29,517 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:36:29,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:29,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1288538040, now seen corresponding path program 1 times [2019-11-23 23:36:29,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:29,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125680844] [2019-11-23 23:36:29,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:30,022 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:36:30,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125680844] [2019-11-23 23:36:30,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:30,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:30,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934742931] [2019-11-23 23:36:30,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:30,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:30,024 INFO L87 Difference]: Start difference. First operand 87948 states and 108365 transitions. Second operand 3 states. [2019-11-23 23:36:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:31,504 INFO L93 Difference]: Finished difference Result 179184 states and 220379 transitions. [2019-11-23 23:36:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:31,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-23 23:36:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:31,599 INFO L225 Difference]: With dead ends: 179184 [2019-11-23 23:36:31,599 INFO L226 Difference]: Without dead ends: 91237 [2019-11-23 23:36:31,652 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:36:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91237 states. [2019-11-23 23:36:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91237 to 89521. [2019-11-23 23:36:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89521 states. [2019-11-23 23:36:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89521 states to 89521 states and 107603 transitions. [2019-11-23 23:36:32,750 INFO L78 Accepts]: Start accepts. Automaton has 89521 states and 107603 transitions. Word has length 271 [2019-11-23 23:36:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:32,750 INFO L462 AbstractCegarLoop]: Abstraction has 89521 states and 107603 transitions. [2019-11-23 23:36:32,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 89521 states and 107603 transitions. [2019-11-23 23:36:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-23 23:36:32,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:32,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:32,778 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:32,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash -884050065, now seen corresponding path program 1 times [2019-11-23 23:36:32,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:32,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044921403] [2019-11-23 23:36:32,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 23:36:32,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044921403] [2019-11-23 23:36:32,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:32,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:32,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768250027] [2019-11-23 23:36:32,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:32,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:32,997 INFO L87 Difference]: Start difference. First operand 89521 states and 107603 transitions. Second operand 4 states. [2019-11-23 23:36:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:34,812 INFO L93 Difference]: Finished difference Result 180187 states and 216406 transitions. [2019-11-23 23:36:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:34,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-23 23:36:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:34,940 INFO L225 Difference]: With dead ends: 180187 [2019-11-23 23:36:34,940 INFO L226 Difference]: Without dead ends: 90667 [2019-11-23 23:36:35,001 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:36:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90667 states. [2019-11-23 23:36:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90667 to 88949. [2019-11-23 23:36:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88949 states. [2019-11-23 23:36:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88949 states to 88949 states and 106389 transitions. [2019-11-23 23:36:39,087 INFO L78 Accepts]: Start accepts. Automaton has 88949 states and 106389 transitions. Word has length 281 [2019-11-23 23:36:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:39,088 INFO L462 AbstractCegarLoop]: Abstraction has 88949 states and 106389 transitions. [2019-11-23 23:36:39,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 88949 states and 106389 transitions. [2019-11-23 23:36:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 23:36:39,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:39,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,117 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1452614610, now seen corresponding path program 1 times [2019-11-23 23:36:39,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:39,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021270831] [2019-11-23 23:36:39,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-23 23:36:39,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021270831] [2019-11-23 23:36:39,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:39,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:39,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866970437] [2019-11-23 23:36:39,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:39,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:39,263 INFO L87 Difference]: Start difference. First operand 88949 states and 106389 transitions. Second operand 4 states. [2019-11-23 23:36:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:40,958 INFO L93 Difference]: Finished difference Result 259695 states and 308652 transitions. [2019-11-23 23:36:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:40,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-23 23:36:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:41,132 INFO L225 Difference]: With dead ends: 259695 [2019-11-23 23:36:41,132 INFO L226 Difference]: Without dead ends: 170747 [2019-11-23 23:36:41,192 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:36:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170747 states. [2019-11-23 23:36:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170747 to 168457. [2019-11-23 23:36:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168457 states. [2019-11-23 23:36:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168457 states to 168457 states and 199588 transitions. [2019-11-23 23:36:45,825 INFO L78 Accepts]: Start accepts. Automaton has 168457 states and 199588 transitions. Word has length 286 [2019-11-23 23:36:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:45,826 INFO L462 AbstractCegarLoop]: Abstraction has 168457 states and 199588 transitions. [2019-11-23 23:36:45,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 168457 states and 199588 transitions. [2019-11-23 23:36:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-23 23:36:45,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:45,867 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:45,867 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -24478051, now seen corresponding path program 1 times [2019-11-23 23:36:45,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:45,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271021990] [2019-11-23 23:36:45,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 189 proven. 8 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-23 23:36:46,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271021990] [2019-11-23 23:36:46,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854413942] [2019-11-23 23:36:46,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:46,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 23:36:46,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:36:46,532 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 163 proven. 85 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:36:46,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-23 23:36:46,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 9 [2019-11-23 23:36:46,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435407712] [2019-11-23 23:36:46,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:46,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:36:46,682 INFO L87 Difference]: Start difference. First operand 168457 states and 199588 transitions. Second operand 4 states. [2019-11-23 23:36:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:48,572 INFO L93 Difference]: Finished difference Result 336913 states and 399175 transitions. [2019-11-23 23:36:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:48,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-23 23:36:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:48,735 INFO L225 Difference]: With dead ends: 336913 [2019-11-23 23:36:48,735 INFO L226 Difference]: Without dead ends: 168457 [2019-11-23 23:36:48,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 23:36:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168457 states. [2019-11-23 23:36:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168457 to 166169. [2019-11-23 23:36:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166169 states. [2019-11-23 23:36:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166169 states to 166169 states and 196142 transitions. [2019-11-23 23:36:51,076 INFO L78 Accepts]: Start accepts. Automaton has 166169 states and 196142 transitions. Word has length 307 [2019-11-23 23:36:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:51,076 INFO L462 AbstractCegarLoop]: Abstraction has 166169 states and 196142 transitions. [2019-11-23 23:36:51,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 166169 states and 196142 transitions. [2019-11-23 23:36:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-23 23:36:51,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:51,117 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:51,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:51,318 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2038548512, now seen corresponding path program 1 times [2019-11-23 23:36:51,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:51,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782874539] [2019-11-23 23:36:51,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-23 23:36:51,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782874539] [2019-11-23 23:36:51,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570475393] [2019-11-23 23:36:51,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:51,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:51,487 INFO L87 Difference]: Start difference. First operand 166169 states and 196142 transitions. Second operand 3 states. [2019-11-23 23:36:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:54,944 INFO L93 Difference]: Finished difference Result 348067 states and 410690 transitions. [2019-11-23 23:36:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:54,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-23 23:36:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:55,118 INFO L225 Difference]: With dead ends: 348067 [2019-11-23 23:36:55,118 INFO L226 Difference]: Without dead ends: 181899 [2019-11-23 23:36:55,201 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:36:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181899 states. [2019-11-23 23:36:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181899 to 180040. [2019-11-23 23:36:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180040 states. [2019-11-23 23:36:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180040 states to 180040 states and 207693 transitions. [2019-11-23 23:36:57,381 INFO L78 Accepts]: Start accepts. Automaton has 180040 states and 207693 transitions. Word has length 330 [2019-11-23 23:36:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:57,382 INFO L462 AbstractCegarLoop]: Abstraction has 180040 states and 207693 transitions. [2019-11-23 23:36:57,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 180040 states and 207693 transitions. [2019-11-23 23:36:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-23 23:36:57,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:57,420 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, 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, 1, 1, 1, 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:36:57,421 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 592263788, now seen corresponding path program 1 times [2019-11-23 23:36:57,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:57,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645934093] [2019-11-23 23:36:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:57,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645934093] [2019-11-23 23:36:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:57,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011774994] [2019-11-23 23:36:57,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:57,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:57,772 INFO L87 Difference]: Start difference. First operand 180040 states and 207693 transitions. Second operand 4 states. [2019-11-23 23:37:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:00,055 INFO L93 Difference]: Finished difference Result 360937 states and 416473 transitions. [2019-11-23 23:37:00,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:37:00,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2019-11-23 23:37:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:00,231 INFO L225 Difference]: With dead ends: 360937 [2019-11-23 23:37:00,231 INFO L226 Difference]: Without dead ends: 180898 [2019-11-23 23:37:00,310 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:37:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180898 states.