/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_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:34:23,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:34:23,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:34:23,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:34:23,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:34:23,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:34:23,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:34:23,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:34:23,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:34:23,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:34:23,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:34:23,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:34:23,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:34:23,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:34:23,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:34:23,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:34:23,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:34:23,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:34:23,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:34:23,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:34:23,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:34:23,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:34:23,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:34:23,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:34:23,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:34:23,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:34:23,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:34:23,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:34:23,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:34:23,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:34:23,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:34:23,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:34:23,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:34:23,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:34:23,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:34:23,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:34:23,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:34:23,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:34:23,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:34:23,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:34:23,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:34:23,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:34:23,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:34:23,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:34:23,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:34:23,285 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:34:23,285 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:34:23,285 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:34:23,285 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:34:23,286 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:34:23,286 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:34:23,286 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:34:23,286 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:34:23,286 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:34:23,287 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:34:23,287 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:34:23,287 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:34:23,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:34:23,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:34:23,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:34:23,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:34:23,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:34:23,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:34:23,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:34:23,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:34:23,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:34:23,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:34:23,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:34:23,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:34:23,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:34:23,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:34:23,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:34:23,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:34:23,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:34:23,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:34:23,291 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:34:23,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:34:23,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:34:23,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:34:23,292 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:34:23,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:34:23,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:34:23,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:34:23,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:34:23,585 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:34:23,585 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-11-23 23:34:23,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2649818f8/0b0bb7ec529c4627b9a3e8ea385e0875/FLAG6e40f0835 [2019-11-23 23:34:24,316 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:34:24,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-11-23 23:34:24,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2649818f8/0b0bb7ec529c4627b9a3e8ea385e0875/FLAG6e40f0835 [2019-11-23 23:34:24,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2649818f8/0b0bb7ec529c4627b9a3e8ea385e0875 [2019-11-23 23:34:24,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:34:24,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:34:24,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:24,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:34:24,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:34:24,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:24" (1/1) ... [2019-11-23 23:34:24,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395bc66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:24, skipping insertion in model container [2019-11-23 23:34:24,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:24" (1/1) ... [2019-11-23 23:34:24,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:34:24,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:34:25,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:25,470 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:34:25,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:34:25,843 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:34:25,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25 WrapperNode [2019-11-23 23:34:25,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:34:25,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:25,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:34:25,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:34:25,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:25,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:34:26,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:34:26,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:34:26,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:34:26,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... [2019-11-23 23:34:26,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:34:26,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:34:26,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:34:26,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:34:26,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:34:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:34:26,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:34:29,400 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:34:29,400 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:34:29,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:29 BoogieIcfgContainer [2019-11-23 23:34:29,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:34:29,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:34:29,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:34:29,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:34:29,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:34:24" (1/3) ... [2019-11-23 23:34:29,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1381c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:29, skipping insertion in model container [2019-11-23 23:34:29,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:25" (2/3) ... [2019-11-23 23:34:29,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1381c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:29, skipping insertion in model container [2019-11-23 23:34:29,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:29" (3/3) ... [2019-11-23 23:34:29,410 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label22.c [2019-11-23 23:34:29,420 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:34:29,428 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:34:29,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:34:29,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:34:29,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:34:29,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:34:29,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:34:29,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:34:29,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:34:29,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:34:29,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:34:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:34:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:34:29,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:29,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:29,503 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1467447007, now seen corresponding path program 1 times [2019-11-23 23:34:29,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:29,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005072170] [2019-11-23 23:34:29,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:30,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005072170] [2019-11-23 23:34:30,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:30,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:30,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381456993] [2019-11-23 23:34:30,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:30,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:30,147 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-23 23:34:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:31,329 INFO L93 Difference]: Finished difference Result 440 states and 860 transitions. [2019-11-23 23:34:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:31,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-23 23:34:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:31,347 INFO L225 Difference]: With dead ends: 440 [2019-11-23 23:34:31,347 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 23:34:31,351 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:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 23:34:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-23 23:34:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:34:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 549 transitions. [2019-11-23 23:34:31,415 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 549 transitions. Word has length 143 [2019-11-23 23:34:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:31,417 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 549 transitions. [2019-11-23 23:34:31,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 549 transitions. [2019-11-23 23:34:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:34:31,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:31,422 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:31,422 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 732722115, now seen corresponding path program 1 times [2019-11-23 23:34:31,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:31,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422094281] [2019-11-23 23:34:31,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:31,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422094281] [2019-11-23 23:34:31,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:31,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:31,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095791745] [2019-11-23 23:34:31,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:31,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:31,509 INFO L87 Difference]: Start difference. First operand 289 states and 549 transitions. Second operand 4 states. [2019-11-23 23:34:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:33,079 INFO L93 Difference]: Finished difference Result 1151 states and 2192 transitions. [2019-11-23 23:34:33,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:33,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:34:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:33,085 INFO L225 Difference]: With dead ends: 1151 [2019-11-23 23:34:33,086 INFO L226 Difference]: Without dead ends: 863 [2019-11-23 23:34:33,088 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:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-11-23 23:34:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 575. [2019-11-23 23:34:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:34:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-23 23:34:33,137 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 148 [2019-11-23 23:34:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:33,138 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-23 23:34:33,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-23 23:34:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:34:33,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:33,151 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash 760400222, now seen corresponding path program 1 times [2019-11-23 23:34:33,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:33,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452293566] [2019-11-23 23:34:33,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:33,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452293566] [2019-11-23 23:34:33,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:33,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:33,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888631714] [2019-11-23 23:34:33,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:33,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:33,499 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-11-23 23:34:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:35,390 INFO L93 Difference]: Finished difference Result 2293 states and 4055 transitions. [2019-11-23 23:34:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:35,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 23:34:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:35,401 INFO L225 Difference]: With dead ends: 2293 [2019-11-23 23:34:35,402 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:34:35,404 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:34:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:34:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:34:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:34:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2663 transitions. [2019-11-23 23:34:35,452 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2663 transitions. Word has length 150 [2019-11-23 23:34:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:35,453 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2663 transitions. [2019-11-23 23:34:35,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2663 transitions. [2019-11-23 23:34:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:34:35,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:35,461 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:34:35,461 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash 559040871, now seen corresponding path program 1 times [2019-11-23 23:34:35,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:35,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459762198] [2019-11-23 23:34:35,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:35,567 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:34:35,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459762198] [2019-11-23 23:34:35,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:35,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:35,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280149986] [2019-11-23 23:34:35,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:35,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:35,570 INFO L87 Difference]: Start difference. First operand 1719 states and 2663 transitions. Second operand 3 states. [2019-11-23 23:34:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:36,051 INFO L93 Difference]: Finished difference Result 5155 states and 7987 transitions. [2019-11-23 23:34:36,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:36,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:34:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:36,092 INFO L225 Difference]: With dead ends: 5155 [2019-11-23 23:34:36,092 INFO L226 Difference]: Without dead ends: 3437 [2019-11-23 23:34:36,095 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:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2019-11-23 23:34:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3435. [2019-11-23 23:34:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:34:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5312 transitions. [2019-11-23 23:34:36,171 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5312 transitions. Word has length 163 [2019-11-23 23:34:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:36,172 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5312 transitions. [2019-11-23 23:34:36,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5312 transitions. [2019-11-23 23:34:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:34:36,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:36,180 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:34:36,180 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1010834477, now seen corresponding path program 1 times [2019-11-23 23:34:36,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:36,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129268921] [2019-11-23 23:34:36,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:36,250 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:34:36,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129268921] [2019-11-23 23:34:36,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:36,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:36,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041746248] [2019-11-23 23:34:36,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:36,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:36,253 INFO L87 Difference]: Start difference. First operand 3435 states and 5312 transitions. Second operand 3 states. [2019-11-23 23:34:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:36,755 INFO L93 Difference]: Finished difference Result 6869 states and 10623 transitions. [2019-11-23 23:34:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:36,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:34:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:36,772 INFO L225 Difference]: With dead ends: 6869 [2019-11-23 23:34:36,772 INFO L226 Difference]: Without dead ends: 3435 [2019-11-23 23:34:36,777 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:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-23 23:34:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-23 23:34:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:34:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5180 transitions. [2019-11-23 23:34:36,839 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5180 transitions. Word has length 171 [2019-11-23 23:34:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:36,839 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5180 transitions. [2019-11-23 23:34:36,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5180 transitions. [2019-11-23 23:34:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:34:36,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:36,845 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:34:36,846 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1690903899, now seen corresponding path program 1 times [2019-11-23 23:34:36,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:36,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219784895] [2019-11-23 23:34:36,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:37,008 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:34:37,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219784895] [2019-11-23 23:34:37,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:37,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:37,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844680877] [2019-11-23 23:34:37,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:37,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:37,013 INFO L87 Difference]: Start difference. First operand 3435 states and 5180 transitions. Second operand 5 states. [2019-11-23 23:34:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:38,923 INFO L93 Difference]: Finished difference Result 8017 states and 12263 transitions. [2019-11-23 23:34:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:38,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-23 23:34:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:38,944 INFO L225 Difference]: With dead ends: 8017 [2019-11-23 23:34:38,944 INFO L226 Difference]: Without dead ends: 4583 [2019-11-23 23:34:38,949 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:34:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-23 23:34:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4007. [2019-11-23 23:34:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-23 23:34:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6060 transitions. [2019-11-23 23:34:39,029 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6060 transitions. Word has length 181 [2019-11-23 23:34:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:39,030 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 6060 transitions. [2019-11-23 23:34:39,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6060 transitions. [2019-11-23 23:34:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-23 23:34:39,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:39,038 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:34:39,038 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1151908303, now seen corresponding path program 1 times [2019-11-23 23:34:39,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:39,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399269575] [2019-11-23 23:34:39,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:39,152 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:34:39,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399269575] [2019-11-23 23:34:39,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898009394] [2019-11-23 23:34:39,153 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:34:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:39,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:39,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:39,461 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:34:39,461 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:39,516 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:34:39,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:39,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-11-23 23:34:39,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136334733] [2019-11-23 23:34:39,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:39,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:39,519 INFO L87 Difference]: Start difference. First operand 4007 states and 6060 transitions. Second operand 3 states. [2019-11-23 23:34:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:39,954 INFO L93 Difference]: Finished difference Result 12019 states and 18178 transitions. [2019-11-23 23:34:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:39,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-23 23:34:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:40,005 INFO L225 Difference]: With dead ends: 12019 [2019-11-23 23:34:40,005 INFO L226 Difference]: Without dead ends: 8013 [2019-11-23 23:34:40,014 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:34:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2019-11-23 23:34:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 8011. [2019-11-23 23:34:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:34:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 12096 transitions. [2019-11-23 23:34:40,210 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 12096 transitions. Word has length 215 [2019-11-23 23:34:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:40,211 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 12096 transitions. [2019-11-23 23:34:40,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 12096 transitions. [2019-11-23 23:34:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 23:34:40,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:40,222 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:34:40,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:40,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash -645085807, now seen corresponding path program 1 times [2019-11-23 23:34:40,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:40,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557427963] [2019-11-23 23:34:40,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:40,654 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:34:40,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557427963] [2019-11-23 23:34:40,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:40,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:40,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718200457] [2019-11-23 23:34:40,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:40,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:40,658 INFO L87 Difference]: Start difference. First operand 8011 states and 12096 transitions. Second operand 3 states. [2019-11-23 23:34:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:41,705 INFO L93 Difference]: Finished difference Result 22742 states and 34297 transitions. [2019-11-23 23:34:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:41,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-23 23:34:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:41,754 INFO L225 Difference]: With dead ends: 22742 [2019-11-23 23:34:41,754 INFO L226 Difference]: Without dead ends: 14732 [2019-11-23 23:34:41,767 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:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14732 states. [2019-11-23 23:34:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14732 to 14732. [2019-11-23 23:34:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-11-23 23:34:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 20554 transitions. [2019-11-23 23:34:42,083 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 20554 transitions. Word has length 216 [2019-11-23 23:34:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:42,084 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 20554 transitions. [2019-11-23 23:34:42,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 20554 transitions. [2019-11-23 23:34:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 23:34:42,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:42,109 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:42,109 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash -867049662, now seen corresponding path program 1 times [2019-11-23 23:34:42,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:42,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935681950] [2019-11-23 23:34:42,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:42,247 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:42,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935681950] [2019-11-23 23:34:42,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:42,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:42,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535212187] [2019-11-23 23:34:42,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:42,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:42,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:42,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:42,250 INFO L87 Difference]: Start difference. First operand 14732 states and 20554 transitions. Second operand 3 states. [2019-11-23 23:34:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:43,390 INFO L93 Difference]: Finished difference Result 32466 states and 45895 transitions. [2019-11-23 23:34:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:43,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 23:34:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:43,425 INFO L225 Difference]: With dead ends: 32466 [2019-11-23 23:34:43,427 INFO L226 Difference]: Without dead ends: 17735 [2019-11-23 23:34:43,441 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:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17735 states. [2019-11-23 23:34:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17735 to 17735. [2019-11-23 23:34:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17735 states. [2019-11-23 23:34:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 23343 transitions. [2019-11-23 23:34:43,716 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 23343 transitions. Word has length 220 [2019-11-23 23:34:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:43,717 INFO L462 AbstractCegarLoop]: Abstraction has 17735 states and 23343 transitions. [2019-11-23 23:34:43,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 23343 transitions. [2019-11-23 23:34:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:34:43,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:43,733 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:43,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2120057251, now seen corresponding path program 1 times [2019-11-23 23:34:43,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108678146] [2019-11-23 23:34:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:43,895 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:43,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108678146] [2019-11-23 23:34:43,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:43,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:43,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657762343] [2019-11-23 23:34:43,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:43,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:43,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:43,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:43,902 INFO L87 Difference]: Start difference. First operand 17735 states and 23343 transitions. Second operand 4 states. [2019-11-23 23:34:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:45,617 INFO L93 Difference]: Finished difference Result 53630 states and 69872 transitions. [2019-11-23 23:34:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:45,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-23 23:34:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:45,680 INFO L225 Difference]: With dead ends: 53630 [2019-11-23 23:34:45,680 INFO L226 Difference]: Without dead ends: 35896 [2019-11-23 23:34:45,700 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:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2019-11-23 23:34:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 28746. [2019-11-23 23:34:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28746 states. [2019-11-23 23:34:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28746 states to 28746 states and 36618 transitions. [2019-11-23 23:34:46,174 INFO L78 Accepts]: Start accepts. Automaton has 28746 states and 36618 transitions. Word has length 221 [2019-11-23 23:34:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 28746 states and 36618 transitions. [2019-11-23 23:34:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 28746 states and 36618 transitions. [2019-11-23 23:34:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-23 23:34:46,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:46,200 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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:46,200 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1219777187, now seen corresponding path program 1 times [2019-11-23 23:34:46,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:46,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552755097] [2019-11-23 23:34:46,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 23:34:46,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552755097] [2019-11-23 23:34:46,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:46,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:46,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686078977] [2019-11-23 23:34:46,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:46,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:46,311 INFO L87 Difference]: Start difference. First operand 28746 states and 36618 transitions. Second operand 4 states. [2019-11-23 23:34:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:47,711 INFO L93 Difference]: Finished difference Result 60494 states and 77824 transitions. [2019-11-23 23:34:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:47,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-23 23:34:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:47,757 INFO L225 Difference]: With dead ends: 60494 [2019-11-23 23:34:47,757 INFO L226 Difference]: Without dead ends: 31749 [2019-11-23 23:34:47,781 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:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2019-11-23 23:34:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31177. [2019-11-23 23:34:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31177 states. [2019-11-23 23:34:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31177 states to 31177 states and 38199 transitions. [2019-11-23 23:34:48,186 INFO L78 Accepts]: Start accepts. Automaton has 31177 states and 38199 transitions. Word has length 242 [2019-11-23 23:34:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:48,186 INFO L462 AbstractCegarLoop]: Abstraction has 31177 states and 38199 transitions. [2019-11-23 23:34:48,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31177 states and 38199 transitions. [2019-11-23 23:34:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 23:34:48,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:48,206 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:48,207 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1266271838, now seen corresponding path program 1 times [2019-11-23 23:34:48,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:48,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449376135] [2019-11-23 23:34:48,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:48,332 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:48,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449376135] [2019-11-23 23:34:48,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:48,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:48,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003015064] [2019-11-23 23:34:48,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:48,334 INFO L87 Difference]: Start difference. First operand 31177 states and 38199 transitions. Second operand 4 states. [2019-11-23 23:34:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:50,301 INFO L93 Difference]: Finished difference Result 112264 states and 137173 transitions. [2019-11-23 23:34:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:50,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-23 23:34:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:50,384 INFO L225 Difference]: With dead ends: 112264 [2019-11-23 23:34:50,384 INFO L226 Difference]: Without dead ends: 81088 [2019-11-23 23:34:50,425 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:50,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81088 states. [2019-11-23 23:34:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81088 to 81084. [2019-11-23 23:34:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81084 states. [2019-11-23 23:34:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81084 states to 81084 states and 98646 transitions. [2019-11-23 23:34:52,499 INFO L78 Accepts]: Start accepts. Automaton has 81084 states and 98646 transitions. Word has length 244 [2019-11-23 23:34:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:52,499 INFO L462 AbstractCegarLoop]: Abstraction has 81084 states and 98646 transitions. [2019-11-23 23:34:52,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 81084 states and 98646 transitions. [2019-11-23 23:34:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-23 23:34:52,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:52,515 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:34:52,515 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1719155430, now seen corresponding path program 1 times [2019-11-23 23:34:52,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:52,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368654956] [2019-11-23 23:34:52,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 23:34:52,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368654956] [2019-11-23 23:34:52,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:52,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:52,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870305088] [2019-11-23 23:34:52,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:52,624 INFO L87 Difference]: Start difference. First operand 81084 states and 98646 transitions. Second operand 3 states. [2019-11-23 23:34:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:54,807 INFO L93 Difference]: Finished difference Result 170604 states and 207886 transitions. [2019-11-23 23:34:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:54,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-11-23 23:34:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:54,902 INFO L225 Difference]: With dead ends: 170604 [2019-11-23 23:34:54,903 INFO L226 Difference]: Without dead ends: 89521 [2019-11-23 23:34:54,956 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:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89521 states. [2019-11-23 23:34:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89521 to 89521. [2019-11-23 23:34:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89521 states. [2019-11-23 23:34:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89521 states to 89521 states and 107485 transitions. [2019-11-23 23:34:56,016 INFO L78 Accepts]: Start accepts. Automaton has 89521 states and 107485 transitions. Word has length 276 [2019-11-23 23:34:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:56,016 INFO L462 AbstractCegarLoop]: Abstraction has 89521 states and 107485 transitions. [2019-11-23 23:34:56,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 89521 states and 107485 transitions. [2019-11-23 23:34:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-23 23:34:56,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:56,027 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:56,028 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1232398262, now seen corresponding path program 1 times [2019-11-23 23:34:56,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:56,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091321868] [2019-11-23 23:34:56,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 23:34:56,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091321868] [2019-11-23 23:34:56,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:56,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:56,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244966124] [2019-11-23 23:34:56,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:56,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:56,143 INFO L87 Difference]: Start difference. First operand 89521 states and 107485 transitions. Second operand 3 states. [2019-11-23 23:34:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:57,952 INFO L93 Difference]: Finished difference Result 217079 states and 259224 transitions. [2019-11-23 23:34:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:57,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-11-23 23:34:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:58,084 INFO L225 Difference]: With dead ends: 217079 [2019-11-23 23:34:58,084 INFO L226 Difference]: Without dead ends: 127559 [2019-11-23 23:34:58,134 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:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127559 states. [2019-11-23 23:35:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127559 to 127559. [2019-11-23 23:35:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127559 states. [2019-11-23 23:35:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127559 states to 127559 states and 151547 transitions. [2019-11-23 23:35:01,348 INFO L78 Accepts]: Start accepts. Automaton has 127559 states and 151547 transitions. Word has length 279 [2019-11-23 23:35:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:01,348 INFO L462 AbstractCegarLoop]: Abstraction has 127559 states and 151547 transitions. [2019-11-23 23:35:01,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 127559 states and 151547 transitions. [2019-11-23 23:35:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 23:35:01,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:01,362 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:01,362 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2018313337, now seen corresponding path program 1 times [2019-11-23 23:35:01,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:01,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74341782] [2019-11-23 23:35:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 23:35:01,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74341782] [2019-11-23 23:35:01,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426294468] [2019-11-23 23:35:01,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:01,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:01,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 23:35:02,094 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 23:35:02,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:02,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:02,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594455227] [2019-11-23 23:35:02,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:02,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:02,151 INFO L87 Difference]: Start difference. First operand 127559 states and 151547 transitions. Second operand 3 states. [2019-11-23 23:35:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:03,703 INFO L93 Difference]: Finished difference Result 282430 states and 334237 transitions. [2019-11-23 23:35:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:03,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2019-11-23 23:35:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:03,865 INFO L225 Difference]: With dead ends: 282430 [2019-11-23 23:35:03,865 INFO L226 Difference]: Without dead ends: 154872 [2019-11-23 23:35:03,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154872 states. [2019-11-23 23:35:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154872 to 148294. [2019-11-23 23:35:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148294 states. [2019-11-23 23:35:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148294 states to 148294 states and 174410 transitions. [2019-11-23 23:35:08,265 INFO L78 Accepts]: Start accepts. Automaton has 148294 states and 174410 transitions. Word has length 286 [2019-11-23 23:35:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:08,265 INFO L462 AbstractCegarLoop]: Abstraction has 148294 states and 174410 transitions. [2019-11-23 23:35:08,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 148294 states and 174410 transitions. [2019-11-23 23:35:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 23:35:08,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:08,296 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:35:08,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:08,500 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1581734949, now seen corresponding path program 1 times [2019-11-23 23:35:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:08,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035636977] [2019-11-23 23:35:08,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:35:08,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035636977] [2019-11-23 23:35:08,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227599948] [2019-11-23 23:35:08,655 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:35:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:08,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 23:35:08,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:35:08,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-23 23:35:09,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:09,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:09,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368855756] [2019-11-23 23:35:09,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:09,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:09,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:09,051 INFO L87 Difference]: Start difference. First operand 148294 states and 174410 transitions. Second operand 4 states. [2019-11-23 23:35:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:11,547 INFO L93 Difference]: Finished difference Result 390683 states and 460681 transitions. [2019-11-23 23:35:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:11,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-11-23 23:35:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:11,796 INFO L225 Difference]: With dead ends: 390683 [2019-11-23 23:35:11,797 INFO L226 Difference]: Without dead ends: 242390 [2019-11-23 23:35:11,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:35:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242390 states. [2019-11-23 23:35:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242390 to 232664. [2019-11-23 23:35:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232664 states. [2019-11-23 23:35:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232664 states to 232664 states and 271993 transitions. [2019-11-23 23:35:17,826 INFO L78 Accepts]: Start accepts. Automaton has 232664 states and 271993 transitions. Word has length 336 [2019-11-23 23:35:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:17,826 INFO L462 AbstractCegarLoop]: Abstraction has 232664 states and 271993 transitions. [2019-11-23 23:35:17,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 232664 states and 271993 transitions. [2019-11-23 23:35:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-23 23:35:17,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:17,864 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:18,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:18,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1362631301, now seen corresponding path program 1 times [2019-11-23 23:35:18,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:18,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424989866] [2019-11-23 23:35:18,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 23:35:18,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424989866] [2019-11-23 23:35:18,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:18,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:18,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221123435] [2019-11-23 23:35:18,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:18,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:18,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:18,249 INFO L87 Difference]: Start difference. First operand 232664 states and 271993 transitions. Second operand 5 states. [2019-11-23 23:35:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:21,755 INFO L93 Difference]: Finished difference Result 607612 states and 703044 transitions. [2019-11-23 23:35:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:35:21,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2019-11-23 23:35:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:22,160 INFO L225 Difference]: With dead ends: 607612 [2019-11-23 23:35:22,161 INFO L226 Difference]: Without dead ends: 374949 [2019-11-23 23:35:22,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374949 states. [2019-11-23 23:35:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374949 to 364796. [2019-11-23 23:35:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364796 states. [2019-11-23 23:35:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364796 states to 364796 states and 420015 transitions. [2019-11-23 23:35:31,814 INFO L78 Accepts]: Start accepts. Automaton has 364796 states and 420015 transitions. Word has length 336 [2019-11-23 23:35:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:31,815 INFO L462 AbstractCegarLoop]: Abstraction has 364796 states and 420015 transitions. [2019-11-23 23:35:31,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 364796 states and 420015 transitions. [2019-11-23 23:35:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-23 23:35:31,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:31,855 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:35:31,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash 829418847, now seen corresponding path program 1 times [2019-11-23 23:35:31,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:31,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846463448] [2019-11-23 23:35:31,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:32,276 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:35:32,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846463448] [2019-11-23 23:35:32,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837739627] [2019-11-23 23:35:32,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:32,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:32,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:32,784 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:35:32,784 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:33,743 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:35:33,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:33,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-11-23 23:35:33,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164155521] [2019-11-23 23:35:33,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:33,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:33,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:35:33,745 INFO L87 Difference]: Start difference. First operand 364796 states and 420015 transitions. Second operand 4 states.