/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_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:44,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:44,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:44,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:44,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:44,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:44,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:44,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:44,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:44,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:44,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:44,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:44,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:44,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:44,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:44,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:44,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:44,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:44,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:44,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:44,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:44,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:44,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:44,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:44,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:44,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:44,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:44,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:44,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:44,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:44,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:44,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:44,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:44,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:44,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:44,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:44,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:44,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:44,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:44,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:44,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:44,798 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:33:44,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:44,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:44,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:44,826 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:44,826 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:44,826 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:44,827 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:44,827 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:44,827 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:44,827 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:44,828 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:44,829 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:44,829 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:44,830 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:44,830 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:44,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:44,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:44,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:44,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:44,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:44,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:44,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:44,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:44,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:44,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:44,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:44,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:44,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:44,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:44,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:44,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:44,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:44,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:44,837 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:44,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:44,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:44,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:44,838 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:45,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:45,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:45,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:45,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:45,197 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:45,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label06.c [2019-11-23 23:33:45,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcb4dcd0/81ea90b928bc4a3db296e286ceec9f05/FLAG000f36442 [2019-11-23 23:33:45,941 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:45,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label06.c [2019-11-23 23:33:45,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcb4dcd0/81ea90b928bc4a3db296e286ceec9f05/FLAG000f36442 [2019-11-23 23:33:46,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adcb4dcd0/81ea90b928bc4a3db296e286ceec9f05 [2019-11-23 23:33:46,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:46,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:46,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:46,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:46,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:46,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:46" (1/1) ... [2019-11-23 23:33:46,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1372a16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:46, skipping insertion in model container [2019-11-23 23:33:46,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:46" (1/1) ... [2019-11-23 23:33:46,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:46,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:47,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:47,054 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:47,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:47,596 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:47,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47 WrapperNode [2019-11-23 23:33:47,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:47,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:47,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:47,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:47,608 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:33:47" (1/1) ... [2019-11-23 23:33:47,651 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:33:47" (1/1) ... [2019-11-23 23:33:47,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:47,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:47,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:47,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:47,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:47,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:47,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:47,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:47,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (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:33:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:50,994 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:50,995 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:50,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:50 BoogieIcfgContainer [2019-11-23 23:33:50,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:50,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:50,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:51,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:51,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:46" (1/3) ... [2019-11-23 23:33:51,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2785bdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:51, skipping insertion in model container [2019-11-23 23:33:51,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47" (2/3) ... [2019-11-23 23:33:51,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2785bdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:51, skipping insertion in model container [2019-11-23 23:33:51,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:50" (3/3) ... [2019-11-23 23:33:51,006 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label06.c [2019-11-23 23:33:51,016 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:51,025 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:51,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:51,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:51,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:51,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:51,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:51,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:51,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:51,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:51,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:33:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:33:51,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:51,115 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:33:51,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1467446495, now seen corresponding path program 1 times [2019-11-23 23:33:51,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:51,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407879075] [2019-11-23 23:33:51,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:51,829 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:33:51,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407879075] [2019-11-23 23:33:51,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:51,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:51,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072725257] [2019-11-23 23:33:51,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:51,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:51,857 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:33:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:53,668 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:33:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:53,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:33:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:53,697 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:33:53,697 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:33:53,703 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:33:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:33:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-11-23 23:33:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-23 23:33:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-11-23 23:33:53,781 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-11-23 23:33:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:53,782 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-11-23 23:33:53,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-11-23 23:33:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:33:53,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:53,789 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:33:53,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1977873472, now seen corresponding path program 1 times [2019-11-23 23:33:53,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:53,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693077473] [2019-11-23 23:33:53,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:53,938 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:33:53,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693077473] [2019-11-23 23:33:53,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:53,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:53,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73823482] [2019-11-23 23:33:53,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:53,943 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-11-23 23:33:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:54,995 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-11-23 23:33:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:33:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:55,006 INFO L225 Difference]: With dead ends: 1292 [2019-11-23 23:33:55,006 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:33:55,009 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:33:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:33:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-11-23 23:33:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-23 23:33:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1411 transitions. [2019-11-23 23:33:55,050 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1411 transitions. Word has length 151 [2019-11-23 23:33:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:55,051 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1411 transitions. [2019-11-23 23:33:55,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1411 transitions. [2019-11-23 23:33:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:33:55,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:55,056 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:33:55,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash 559041383, now seen corresponding path program 1 times [2019-11-23 23:33:55,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:55,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842878505] [2019-11-23 23:33:55,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:55,170 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:33:55,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842878505] [2019-11-23 23:33:55,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:55,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:55,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584192310] [2019-11-23 23:33:55,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:55,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:55,173 INFO L87 Difference]: Start difference. First operand 861 states and 1411 transitions. Second operand 3 states. [2019-11-23 23:33:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:55,662 INFO L93 Difference]: Finished difference Result 2581 states and 4231 transitions. [2019-11-23 23:33:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:55,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:33:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:55,672 INFO L225 Difference]: With dead ends: 2581 [2019-11-23 23:33:55,672 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:33:55,674 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:33:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:33:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-11-23 23:33:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:33:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2808 transitions. [2019-11-23 23:33:55,717 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2808 transitions. Word has length 163 [2019-11-23 23:33:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:55,717 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2808 transitions. [2019-11-23 23:33:55,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2808 transitions. [2019-11-23 23:33:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:33:55,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:55,723 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1010833965, now seen corresponding path program 1 times [2019-11-23 23:33:55,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:55,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927666473] [2019-11-23 23:33:55,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:33:55,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927666473] [2019-11-23 23:33:55,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:55,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:55,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170299585] [2019-11-23 23:33:55,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:55,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:55,844 INFO L87 Difference]: Start difference. First operand 1719 states and 2808 transitions. Second operand 3 states. [2019-11-23 23:33:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:56,336 INFO L93 Difference]: Finished difference Result 3437 states and 5615 transitions. [2019-11-23 23:33:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:56,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:33:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:56,345 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:33:56,345 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:33:56,348 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:33:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:33:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:33:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:33:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2732 transitions. [2019-11-23 23:33:56,387 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2732 transitions. Word has length 171 [2019-11-23 23:33:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:56,388 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2732 transitions. [2019-11-23 23:33:56,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2732 transitions. [2019-11-23 23:33:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:33:56,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:56,392 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:33:56,392 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1690903387, now seen corresponding path program 1 times [2019-11-23 23:33:56,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:56,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931424233] [2019-11-23 23:33:56,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:56,554 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:33:56,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931424233] [2019-11-23 23:33:56,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:56,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:33:56,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488256454] [2019-11-23 23:33:56,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:33:56,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:33:56,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:33:56,557 INFO L87 Difference]: Start difference. First operand 1719 states and 2732 transitions. Second operand 5 states. [2019-11-23 23:33:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:58,353 INFO L93 Difference]: Finished difference Result 4156 states and 6691 transitions. [2019-11-23 23:33:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:33:58,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:33:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:58,367 INFO L225 Difference]: With dead ends: 4156 [2019-11-23 23:33:58,369 INFO L226 Difference]: Without dead ends: 2438 [2019-11-23 23:33:58,372 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:33:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2019-11-23 23:33:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2005. [2019-11-23 23:33:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-11-23 23:33:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3202 transitions. [2019-11-23 23:33:58,426 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3202 transitions. Word has length 181 [2019-11-23 23:33:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:58,427 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 3202 transitions. [2019-11-23 23:33:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:33:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3202 transitions. [2019-11-23 23:33:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-23 23:33:58,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:58,433 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:58,433 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1151907791, now seen corresponding path program 1 times [2019-11-23 23:33:58,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:58,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27174275] [2019-11-23 23:33:58,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 23:33:58,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27174275] [2019-11-23 23:33:58,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138744948] [2019-11-23 23:33:58,629 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:33:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:58,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:33:58,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:33:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:33:58,925 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:33:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 23:33:58,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:33:58,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:33:58,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158559647] [2019-11-23 23:33:58,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:58,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:58,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:58,976 INFO L87 Difference]: Start difference. First operand 2005 states and 3202 transitions. Second operand 3 states. [2019-11-23 23:33:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:59,278 INFO L93 Difference]: Finished difference Result 6013 states and 9604 transitions. [2019-11-23 23:33:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:59,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-23 23:33:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:59,299 INFO L225 Difference]: With dead ends: 6013 [2019-11-23 23:33:59,300 INFO L226 Difference]: Without dead ends: 4009 [2019-11-23 23:33:59,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 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:33:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-11-23 23:33:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4007. [2019-11-23 23:33:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-23 23:33:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6380 transitions. [2019-11-23 23:33:59,389 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6380 transitions. Word has length 215 [2019-11-23 23:33:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:59,389 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 6380 transitions. [2019-11-23 23:33:59,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6380 transitions. [2019-11-23 23:33:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 23:33:59,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:59,397 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:33:59,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:33:59,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:59,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -645085295, now seen corresponding path program 1 times [2019-11-23 23:33:59,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:59,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338391993] [2019-11-23 23:33:59,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:33:59,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338391993] [2019-11-23 23:33:59,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:59,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:59,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758549219] [2019-11-23 23:33:59,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:59,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:59,826 INFO L87 Difference]: Start difference. First operand 4007 states and 6380 transitions. Second operand 3 states. [2019-11-23 23:34:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:00,672 INFO L93 Difference]: Finished difference Result 12017 states and 19137 transitions. [2019-11-23 23:34:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 23:34:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:00,708 INFO L225 Difference]: With dead ends: 12017 [2019-11-23 23:34:00,708 INFO L226 Difference]: Without dead ends: 8011 [2019-11-23 23:34:00,715 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:34:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8011 states. [2019-11-23 23:34:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8011 to 8011. [2019-11-23 23:34:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:34:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 11620 transitions. [2019-11-23 23:34:00,870 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 11620 transitions. Word has length 216 [2019-11-23 23:34:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:00,871 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 11620 transitions. [2019-11-23 23:34:00,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 11620 transitions. [2019-11-23 23:34:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 23:34:00,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:00,885 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:00,885 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1739459712, now seen corresponding path program 1 times [2019-11-23 23:34:00,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:00,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232212045] [2019-11-23 23:34:00,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:34:01,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232212045] [2019-11-23 23:34:01,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:01,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:01,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563785827] [2019-11-23 23:34:01,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:01,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:01,086 INFO L87 Difference]: Start difference. First operand 8011 states and 11620 transitions. Second operand 3 states. [2019-11-23 23:34:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,948 INFO L93 Difference]: Finished difference Result 18023 states and 26582 transitions. [2019-11-23 23:34:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 23:34:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,986 INFO L225 Difference]: With dead ends: 18023 [2019-11-23 23:34:01,986 INFO L226 Difference]: Without dead ends: 10013 [2019-11-23 23:34:01,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-11-23 23:34:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 10013. [2019-11-23 23:34:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10013 states. [2019-11-23 23:34:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10013 states to 10013 states and 13732 transitions. [2019-11-23 23:34:02,195 INFO L78 Accepts]: Start accepts. Automaton has 10013 states and 13732 transitions. Word has length 220 [2019-11-23 23:34:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:02,195 INFO L462 AbstractCegarLoop]: Abstraction has 10013 states and 13732 transitions. [2019-11-23 23:34:02,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 13732 transitions. [2019-11-23 23:34:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:34:02,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:02,210 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, 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] [2019-11-23 23:34:02,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2120057763, now seen corresponding path program 1 times [2019-11-23 23:34:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887976960] [2019-11-23 23:34:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:02,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887976960] [2019-11-23 23:34:02,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:02,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867043992] [2019-11-23 23:34:02,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:02,404 INFO L87 Difference]: Start difference. First operand 10013 states and 13732 transitions. Second operand 4 states. [2019-11-23 23:34:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:03,825 INFO L93 Difference]: Finished difference Result 33181 states and 45027 transitions. [2019-11-23 23:34:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:03,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-23 23:34:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:03,871 INFO L225 Difference]: With dead ends: 33181 [2019-11-23 23:34:03,871 INFO L226 Difference]: Without dead ends: 23169 [2019-11-23 23:34:03,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23169 states. [2019-11-23 23:34:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23169 to 17449. [2019-11-23 23:34:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17449 states. [2019-11-23 23:34:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17449 states to 17449 states and 22836 transitions. [2019-11-23 23:34:04,196 INFO L78 Accepts]: Start accepts. Automaton has 17449 states and 22836 transitions. Word has length 221 [2019-11-23 23:34:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:04,197 INFO L462 AbstractCegarLoop]: Abstraction has 17449 states and 22836 transitions. [2019-11-23 23:34:04,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 17449 states and 22836 transitions. [2019-11-23 23:34:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 23:34:04,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:04,213 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:04,213 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1247790124, now seen corresponding path program 1 times [2019-11-23 23:34:04,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:04,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109373326] [2019-11-23 23:34:04,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:04,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109373326] [2019-11-23 23:34:04,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45996892] [2019-11-23 23:34:04,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:04,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:04,523 INFO L87 Difference]: Start difference. First operand 17449 states and 22836 transitions. Second operand 4 states. [2019-11-23 23:34:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:05,463 INFO L93 Difference]: Finished difference Result 36041 states and 47387 transitions. [2019-11-23 23:34:05,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:05,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-23 23:34:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:05,501 INFO L225 Difference]: With dead ends: 36041 [2019-11-23 23:34:05,501 INFO L226 Difference]: Without dead ends: 18593 [2019-11-23 23:34:05,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18593 states. [2019-11-23 23:34:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18593 to 17163. [2019-11-23 23:34:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17163 states. [2019-11-23 23:34:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17163 states to 17163 states and 22152 transitions. [2019-11-23 23:34:05,797 INFO L78 Accepts]: Start accepts. Automaton has 17163 states and 22152 transitions. Word has length 229 [2019-11-23 23:34:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:05,798 INFO L462 AbstractCegarLoop]: Abstraction has 17163 states and 22152 transitions. [2019-11-23 23:34:05,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17163 states and 22152 transitions. [2019-11-23 23:34:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 23:34:05,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:05,820 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:05,820 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1266272350, now seen corresponding path program 1 times [2019-11-23 23:34:05,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:05,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157028837] [2019-11-23 23:34:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 23:34:06,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157028837] [2019-11-23 23:34:06,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:06,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:06,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600745528] [2019-11-23 23:34:06,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:06,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:06,090 INFO L87 Difference]: Start difference. First operand 17163 states and 22152 transitions. Second operand 4 states. [2019-11-23 23:34:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:07,681 INFO L93 Difference]: Finished difference Result 66075 states and 85397 transitions. [2019-11-23 23:34:07,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:07,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-23 23:34:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:07,759 INFO L225 Difference]: With dead ends: 66075 [2019-11-23 23:34:07,759 INFO L226 Difference]: Without dead ends: 48913 [2019-11-23 23:34:07,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48913 states. [2019-11-23 23:34:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48913 to 48909. [2019-11-23 23:34:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48909 states. [2019-11-23 23:34:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48909 states to 48909 states and 63065 transitions. [2019-11-23 23:34:09,253 INFO L78 Accepts]: Start accepts. Automaton has 48909 states and 63065 transitions. Word has length 244 [2019-11-23 23:34:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:09,254 INFO L462 AbstractCegarLoop]: Abstraction has 48909 states and 63065 transitions. [2019-11-23 23:34:09,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48909 states and 63065 transitions. [2019-11-23 23:34:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 23:34:09,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:09,265 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:09,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1261932141, now seen corresponding path program 1 times [2019-11-23 23:34:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:09,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741057464] [2019-11-23 23:34:09,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:34:09,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741057464] [2019-11-23 23:34:09,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:09,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:09,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10396490] [2019-11-23 23:34:09,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:09,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:09,363 INFO L87 Difference]: Start difference. First operand 48909 states and 63065 transitions. Second operand 3 states. [2019-11-23 23:34:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:10,906 INFO L93 Difference]: Finished difference Result 119982 states and 153707 transitions. [2019-11-23 23:34:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:10,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-23 23:34:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:11,010 INFO L225 Difference]: With dead ends: 119982 [2019-11-23 23:34:11,010 INFO L226 Difference]: Without dead ends: 71074 [2019-11-23 23:34:11,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71074 states. [2019-11-23 23:34:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71074 to 71074. [2019-11-23 23:34:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71074 states. [2019-11-23 23:34:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71074 states to 71074 states and 90449 transitions. [2019-11-23 23:34:13,350 INFO L78 Accepts]: Start accepts. Automaton has 71074 states and 90449 transitions. Word has length 245 [2019-11-23 23:34:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:13,350 INFO L462 AbstractCegarLoop]: Abstraction has 71074 states and 90449 transitions. [2019-11-23 23:34:13,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71074 states and 90449 transitions. [2019-11-23 23:34:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 23:34:13,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:13,364 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:13,365 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1387580400, now seen corresponding path program 1 times [2019-11-23 23:34:13,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:13,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664897229] [2019-11-23 23:34:13,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 23:34:13,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664897229] [2019-11-23 23:34:13,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747483895] [2019-11-23 23:34:13,508 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:34:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:13,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:13,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-23 23:34:13,850 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-23 23:34:13,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:13,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-11-23 23:34:13,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610526875] [2019-11-23 23:34:13,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:13,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:13,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:13,939 INFO L87 Difference]: Start difference. First operand 71074 states and 90449 transitions. Second operand 3 states. [2019-11-23 23:34:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:15,471 INFO L93 Difference]: Finished difference Result 174036 states and 223299 transitions. [2019-11-23 23:34:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:15,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 23:34:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:15,575 INFO L225 Difference]: With dead ends: 174036 [2019-11-23 23:34:15,576 INFO L226 Difference]: Without dead ends: 102963 [2019-11-23 23:34:15,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102963 states. [2019-11-23 23:34:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102963 to 102963. [2019-11-23 23:34:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102963 states. [2019-11-23 23:34:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102963 states to 102963 states and 129561 transitions. [2019-11-23 23:34:17,069 INFO L78 Accepts]: Start accepts. Automaton has 102963 states and 129561 transitions. Word has length 252 [2019-11-23 23:34:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:17,069 INFO L462 AbstractCegarLoop]: Abstraction has 102963 states and 129561 transitions. [2019-11-23 23:34:17,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 102963 states and 129561 transitions. [2019-11-23 23:34:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-23 23:34:17,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:17,090 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:17,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:17,293 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash -424880394, now seen corresponding path program 1 times [2019-11-23 23:34:17,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:17,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973079105] [2019-11-23 23:34:17,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:17,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973079105] [2019-11-23 23:34:17,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:17,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:17,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844243439] [2019-11-23 23:34:17,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:17,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:17,920 INFO L87 Difference]: Start difference. First operand 102963 states and 129561 transitions. Second operand 3 states. [2019-11-23 23:34:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:19,788 INFO L93 Difference]: Finished difference Result 263127 states and 328537 transitions. [2019-11-23 23:34:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:19,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-11-23 23:34:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:19,950 INFO L225 Difference]: With dead ends: 263127 [2019-11-23 23:34:19,951 INFO L226 Difference]: Without dead ends: 160165 [2019-11-23 23:34:20,010 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:34:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160165 states. [2019-11-23 23:34:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160165 to 141430. [2019-11-23 23:34:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141430 states. [2019-11-23 23:34:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141430 states to 141430 states and 178154 transitions. [2019-11-23 23:34:24,048 INFO L78 Accepts]: Start accepts. Automaton has 141430 states and 178154 transitions. Word has length 302 [2019-11-23 23:34:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:24,049 INFO L462 AbstractCegarLoop]: Abstraction has 141430 states and 178154 transitions. [2019-11-23 23:34:24,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 141430 states and 178154 transitions. [2019-11-23 23:34:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-23 23:34:24,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:24,069 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:24,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1644458127, now seen corresponding path program 1 times [2019-11-23 23:34:24,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:24,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511839882] [2019-11-23 23:34:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 23:34:24,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511839882] [2019-11-23 23:34:24,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:24,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:24,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566896353] [2019-11-23 23:34:24,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:24,368 INFO L87 Difference]: Start difference. First operand 141430 states and 178154 transitions. Second operand 3 states. [2019-11-23 23:34:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:26,356 INFO L93 Difference]: Finished difference Result 322041 states and 403762 transitions. [2019-11-23 23:34:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:26,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-11-23 23:34:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:26,573 INFO L225 Difference]: With dead ends: 322041 [2019-11-23 23:34:26,573 INFO L226 Difference]: Without dead ends: 180612 [2019-11-23 23:34:26,649 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:34:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180612 states. [2019-11-23 23:34:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180612 to 177752. [2019-11-23 23:34:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177752 states. [2019-11-23 23:34:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177752 states to 177752 states and 218347 transitions. [2019-11-23 23:34:29,746 INFO L78 Accepts]: Start accepts. Automaton has 177752 states and 218347 transitions. Word has length 324 [2019-11-23 23:34:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:29,747 INFO L462 AbstractCegarLoop]: Abstraction has 177752 states and 218347 transitions. [2019-11-23 23:34:29,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 177752 states and 218347 transitions. [2019-11-23 23:34:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-23 23:34:29,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:29,787 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:29,787 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 829419359, now seen corresponding path program 1 times [2019-11-23 23:34:29,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:29,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419601661] [2019-11-23 23:34:29,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 196 proven. 8 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:34:30,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419601661] [2019-11-23 23:34:30,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827678122] [2019-11-23 23:34:30,188 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:34:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:30,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:34:30,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:34:33,504 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:34:33,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:33,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-11-23 23:34:33,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782873444] [2019-11-23 23:34:33,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:33,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:33,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:33,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:34:33,635 INFO L87 Difference]: Start difference. First operand 177752 states and 218347 transitions. Second operand 4 states. [2019-11-23 23:34:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:36,279 INFO L93 Difference]: Finished difference Result 406123 states and 498329 transitions. [2019-11-23 23:34:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:36,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-11-23 23:34:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:36,280 INFO L225 Difference]: With dead ends: 406123 [2019-11-23 23:34:36,280 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:34:36,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:34:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:34:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:34:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:34:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:34:36,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 360 [2019-11-23 23:34:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:36,374 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:34:36,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:34:36,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:34:36,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:36,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:34:45,721 WARN L192 SmtUtils]: Spent 9.12 s on a formula simplification. DAG size of input: 2208 DAG size of output: 536 [2019-11-23 23:34:53,365 WARN L192 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 2208 DAG size of output: 536 [2019-11-23 23:34:59,483 WARN L192 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 522 DAG size of output: 60