/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_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:36:33,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:36:33,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:36:33,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:36:33,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:36:33,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:36:33,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:36:33,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:36:33,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:36:33,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:36:33,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:36:33,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:36:33,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:36:33,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:36:33,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:36:33,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:36:33,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:36:33,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:36:33,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:36:33,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:36:33,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:36:33,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:36:33,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:36:33,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:36:33,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:36:33,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:36:33,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:36:33,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:36:33,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:36:33,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:36:33,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:36:33,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:36:33,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:36:33,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:36:33,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:36:33,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:36:33,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:36:33,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:36:33,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:36:33,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:36:33,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:36:33,445 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:36:33,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:36:33,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:36:33,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:36:33,482 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:36:33,482 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:36:33,482 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:36:33,482 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:36:33,482 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:36:33,483 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:36:33,483 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:36:33,483 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:36:33,483 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:36:33,483 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:36:33,485 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:36:33,485 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:36:33,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:36:33,486 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:36:33,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:36:33,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:36:33,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:36:33,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:36:33,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:36:33,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:36:33,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:36:33,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:36:33,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:36:33,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:36:33,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:36:33,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:36:33,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:36:33,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:36:33,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:36:33,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:36:33,490 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:36:33,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:36:33,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:36:33,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:36:33,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:36:33,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:36:33,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:36:33,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:36:33,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:36:33,784 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:36:33,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58.c [2019-11-23 23:36:33,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39389b481/a122e192e1334b0990455c0f2128c434/FLAG13037c6e9 [2019-11-23 23:36:34,525 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:36:34,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label58.c [2019-11-23 23:36:34,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39389b481/a122e192e1334b0990455c0f2128c434/FLAG13037c6e9 [2019-11-23 23:36:34,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39389b481/a122e192e1334b0990455c0f2128c434 [2019-11-23 23:36:34,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:36:34,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:36:34,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:34,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:36:34,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:36:34,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:34" (1/1) ... [2019-11-23 23:36:34,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5d560f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:34, skipping insertion in model container [2019-11-23 23:36:34,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:34" (1/1) ... [2019-11-23 23:36:34,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:36:34,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:36:35,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:35,652 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:36:35,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:36:35,899 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:36:35,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35 WrapperNode [2019-11-23 23:36:35,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:36:35,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:35,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:36:35,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:36:35,912 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:36:35" (1/1) ... [2019-11-23 23:36:35,966 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:36:35" (1/1) ... [2019-11-23 23:36:36,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:36:36,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:36:36,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:36:36,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:36:36,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (1/1) ... [2019-11-23 23:36:36,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:36:36,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:36:36,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:36:36,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:36:36,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (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:36:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:36:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:36:39,457 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:36:39,457 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:36:39,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:39 BoogieIcfgContainer [2019-11-23 23:36:39,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:36:39,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:36:39,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:36:39,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:36:39,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:34" (1/3) ... [2019-11-23 23:36:39,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e1d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:39, skipping insertion in model container [2019-11-23 23:36:39,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:35" (2/3) ... [2019-11-23 23:36:39,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510e1d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:39, skipping insertion in model container [2019-11-23 23:36:39,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:39" (3/3) ... [2019-11-23 23:36:39,470 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label58.c [2019-11-23 23:36:39,480 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:36:39,488 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:36:39,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:36:39,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:36:39,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:36:39,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:36:39,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:36:39,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:36:39,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:36:39,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:36:39,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:36:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:36:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:36:39,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:39,579 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:36:39,580 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1467460331, now seen corresponding path program 1 times [2019-11-23 23:36:39,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:39,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015603657] [2019-11-23 23:36:39,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:40,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015603657] [2019-11-23 23:36:40,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:40,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:40,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905078867] [2019-11-23 23:36:40,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:40,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:40,229 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-23 23:36:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:41,366 INFO L93 Difference]: Finished difference Result 440 states and 860 transitions. [2019-11-23 23:36:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:41,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-23 23:36:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:41,386 INFO L225 Difference]: With dead ends: 440 [2019-11-23 23:36:41,386 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 23:36:41,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 23:36:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-23 23:36:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:36:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 549 transitions. [2019-11-23 23:36:41,452 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 549 transitions. Word has length 143 [2019-11-23 23:36:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:41,453 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 549 transitions. [2019-11-23 23:36:41,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 549 transitions. [2019-11-23 23:36:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 23:36:41,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:41,459 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:41,459 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 732708791, now seen corresponding path program 1 times [2019-11-23 23:36:41,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:41,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370062265] [2019-11-23 23:36:41,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:41,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370062265] [2019-11-23 23:36:41,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:41,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:41,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382560566] [2019-11-23 23:36:41,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:41,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:41,545 INFO L87 Difference]: Start difference. First operand 289 states and 549 transitions. Second operand 4 states. [2019-11-23 23:36:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:43,053 INFO L93 Difference]: Finished difference Result 1149 states and 2191 transitions. [2019-11-23 23:36:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:43,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 23:36:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:43,062 INFO L225 Difference]: With dead ends: 1149 [2019-11-23 23:36:43,062 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:36:43,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:36:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 575. [2019-11-23 23:36:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:36:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1014 transitions. [2019-11-23 23:36:43,110 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1014 transitions. Word has length 148 [2019-11-23 23:36:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:43,111 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1014 transitions. [2019-11-23 23:36:43,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1014 transitions. [2019-11-23 23:36:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 23:36:43,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:43,117 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:43,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1458028067, now seen corresponding path program 1 times [2019-11-23 23:36:43,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:43,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452500552] [2019-11-23 23:36:43,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:43,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452500552] [2019-11-23 23:36:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:43,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586441472] [2019-11-23 23:36:43,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:43,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:43,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:43,192 INFO L87 Difference]: Start difference. First operand 575 states and 1014 transitions. Second operand 3 states. [2019-11-23 23:36:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:43,663 INFO L93 Difference]: Finished difference Result 1149 states and 2027 transitions. [2019-11-23 23:36:43,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:43,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 23:36:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:43,667 INFO L225 Difference]: With dead ends: 1149 [2019-11-23 23:36:43,667 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:36:43,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:36:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:36:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:36:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 964 transitions. [2019-11-23 23:36:43,685 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 964 transitions. Word has length 156 [2019-11-23 23:36:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:43,688 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 964 transitions. [2019-11-23 23:36:43,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 964 transitions. [2019-11-23 23:36:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:36:43,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:43,697 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2019-11-23 23:36:43,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1273580321, now seen corresponding path program 1 times [2019-11-23 23:36:43,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:43,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014923611] [2019-11-23 23:36:43,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 23:36:43,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014923611] [2019-11-23 23:36:43,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:43,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:43,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116854343] [2019-11-23 23:36:43,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:43,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:43,888 INFO L87 Difference]: Start difference. First operand 575 states and 964 transitions. Second operand 4 states. [2019-11-23 23:36:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:45,219 INFO L93 Difference]: Finished difference Result 2295 states and 3852 transitions. [2019-11-23 23:36:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:45,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 23:36:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:45,228 INFO L225 Difference]: With dead ends: 2295 [2019-11-23 23:36:45,229 INFO L226 Difference]: Without dead ends: 1721 [2019-11-23 23:36:45,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-11-23 23:36:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1147. [2019-11-23 23:36:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:36:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1820 transitions. [2019-11-23 23:36:45,263 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1820 transitions. Word has length 157 [2019-11-23 23:36:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:45,263 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1820 transitions. [2019-11-23 23:36:45,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1820 transitions. [2019-11-23 23:36:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-23 23:36:45,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:45,268 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:45,268 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash 210122488, now seen corresponding path program 1 times [2019-11-23 23:36:45,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:45,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866404883] [2019-11-23 23:36:45,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 23:36:45,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866404883] [2019-11-23 23:36:45,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:45,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:45,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965301762] [2019-11-23 23:36:45,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:45,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:45,376 INFO L87 Difference]: Start difference. First operand 1147 states and 1820 transitions. Second operand 3 states. [2019-11-23 23:36:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:46,213 INFO L93 Difference]: Finished difference Result 2865 states and 4524 transitions. [2019-11-23 23:36:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:46,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-23 23:36:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:46,223 INFO L225 Difference]: With dead ends: 2865 [2019-11-23 23:36:46,223 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:36:46,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:36:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:36:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:36:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2681 transitions. [2019-11-23 23:36:46,266 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2681 transitions. Word has length 160 [2019-11-23 23:36:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:46,266 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2681 transitions. [2019-11-23 23:36:46,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2681 transitions. [2019-11-23 23:36:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:36:46,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:46,272 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:46,272 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:46,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash 559027547, now seen corresponding path program 1 times [2019-11-23 23:36:46,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:46,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804821803] [2019-11-23 23:36:46,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 23:36:46,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804821803] [2019-11-23 23:36:46,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:36:46,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188288269] [2019-11-23 23:36:46,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:46,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:46,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:46,339 INFO L87 Difference]: Start difference. First operand 1719 states and 2681 transitions. Second operand 3 states. [2019-11-23 23:36:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:46,783 INFO L93 Difference]: Finished difference Result 5012 states and 7825 transitions. [2019-11-23 23:36:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:46,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 23:36:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:46,800 INFO L225 Difference]: With dead ends: 5012 [2019-11-23 23:36:46,800 INFO L226 Difference]: Without dead ends: 3294 [2019-11-23 23:36:46,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-11-23 23:36:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3292. [2019-11-23 23:36:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-11-23 23:36:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5135 transitions. [2019-11-23 23:36:46,886 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5135 transitions. Word has length 163 [2019-11-23 23:36:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:46,886 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 5135 transitions. [2019-11-23 23:36:46,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5135 transitions. [2019-11-23 23:36:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 23:36:46,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:46,892 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2019-11-23 23:36:46,893 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435958, now seen corresponding path program 1 times [2019-11-23 23:36:46,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:46,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856587635] [2019-11-23 23:36:46,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:47,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856587635] [2019-11-23 23:36:47,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:47,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:47,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316876120] [2019-11-23 23:36:47,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:47,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:47,013 INFO L87 Difference]: Start difference. First operand 3292 states and 5135 transitions. Second operand 3 states. [2019-11-23 23:36:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:47,932 INFO L93 Difference]: Finished difference Result 9872 states and 15402 transitions. [2019-11-23 23:36:47,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:47,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 23:36:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:47,964 INFO L225 Difference]: With dead ends: 9872 [2019-11-23 23:36:47,964 INFO L226 Difference]: Without dead ends: 6581 [2019-11-23 23:36:47,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-11-23 23:36:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-11-23 23:36:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-11-23 23:36:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 9394 transitions. [2019-11-23 23:36:48,104 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 9394 transitions. Word has length 165 [2019-11-23 23:36:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:48,104 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 9394 transitions. [2019-11-23 23:36:48,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 9394 transitions. [2019-11-23 23:36:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 23:36:48,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:48,113 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2019-11-23 23:36:48,113 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1001990053, now seen corresponding path program 2 times [2019-11-23 23:36:48,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:48,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194804152] [2019-11-23 23:36:48,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:48,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194804152] [2019-11-23 23:36:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:48,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:48,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919890779] [2019-11-23 23:36:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:48,177 INFO L87 Difference]: Start difference. First operand 6581 states and 9394 transitions. Second operand 3 states. [2019-11-23 23:36:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:49,125 INFO L93 Difference]: Finished difference Result 17737 states and 25327 transitions. [2019-11-23 23:36:49,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:49,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 23:36:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:49,170 INFO L225 Difference]: With dead ends: 17737 [2019-11-23 23:36:49,170 INFO L226 Difference]: Without dead ends: 11157 [2019-11-23 23:36:49,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2019-11-23 23:36:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2019-11-23 23:36:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-11-23 23:36:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13989 transitions. [2019-11-23 23:36:49,370 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13989 transitions. Word has length 167 [2019-11-23 23:36:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:49,371 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13989 transitions. [2019-11-23 23:36:49,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13989 transitions. [2019-11-23 23:36:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 23:36:49,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:49,384 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:49,385 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash 908763528, now seen corresponding path program 1 times [2019-11-23 23:36:49,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:49,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109498392] [2019-11-23 23:36:49,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 23:36:49,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109498392] [2019-11-23 23:36:49,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:49,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:49,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844425063] [2019-11-23 23:36:49,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:36:49,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:36:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:49,470 INFO L87 Difference]: Start difference. First operand 11157 states and 13989 transitions. Second operand 4 states. [2019-11-23 23:36:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:51,047 INFO L93 Difference]: Finished difference Result 30466 states and 38675 transitions. [2019-11-23 23:36:51,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:36:51,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-23 23:36:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:51,104 INFO L225 Difference]: With dead ends: 30466 [2019-11-23 23:36:51,105 INFO L226 Difference]: Without dead ends: 19310 [2019-11-23 23:36:51,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:36:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2019-11-23 23:36:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 14732. [2019-11-23 23:36:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14732 states. [2019-11-23 23:36:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14732 states to 14732 states and 18256 transitions. [2019-11-23 23:36:51,359 INFO L78 Accepts]: Start accepts. Automaton has 14732 states and 18256 transitions. Word has length 185 [2019-11-23 23:36:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:51,360 INFO L462 AbstractCegarLoop]: Abstraction has 14732 states and 18256 transitions. [2019-11-23 23:36:51,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:36:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 14732 states and 18256 transitions. [2019-11-23 23:36:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 23:36:51,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:51,379 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:51,379 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2133683367, now seen corresponding path program 1 times [2019-11-23 23:36:51,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:51,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722137654] [2019-11-23 23:36:51,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:36:51,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722137654] [2019-11-23 23:36:51,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:51,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:36:51,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139902125] [2019-11-23 23:36:51,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:36:51,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:36:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:51,533 INFO L87 Difference]: Start difference. First operand 14732 states and 18256 transitions. Second operand 5 states. [2019-11-23 23:36:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:53,559 INFO L93 Difference]: Finished difference Result 63646 states and 79196 transitions. [2019-11-23 23:36:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:36:53,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-11-23 23:36:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:53,714 INFO L225 Difference]: With dead ends: 63646 [2019-11-23 23:36:53,716 INFO L226 Difference]: Without dead ends: 48915 [2019-11-23 23:36:53,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:36:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48915 states. [2019-11-23 23:36:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48915 to 48909. [2019-11-23 23:36:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48909 states. [2019-11-23 23:36:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48909 states to 48909 states and 60865 transitions. [2019-11-23 23:36:55,549 INFO L78 Accepts]: Start accepts. Automaton has 48909 states and 60865 transitions. Word has length 210 [2019-11-23 23:36:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:55,549 INFO L462 AbstractCegarLoop]: Abstraction has 48909 states and 60865 transitions. [2019-11-23 23:36:55,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:36:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 48909 states and 60865 transitions. [2019-11-23 23:36:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:36:55,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:55,568 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:36:55,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash 625365775, now seen corresponding path program 1 times [2019-11-23 23:36:55,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:55,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602439769] [2019-11-23 23:36:55,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:36:55,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602439769] [2019-11-23 23:36:55,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:36:55,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:36:55,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226309431] [2019-11-23 23:36:55,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:55,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:55,696 INFO L87 Difference]: Start difference. First operand 48909 states and 60865 transitions. Second operand 3 states. [2019-11-23 23:36:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:36:56,855 INFO L93 Difference]: Finished difference Result 112689 states and 140247 transitions. [2019-11-23 23:36:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:36:56,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:36:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:36:56,965 INFO L225 Difference]: With dead ends: 112689 [2019-11-23 23:36:56,965 INFO L226 Difference]: Without dead ends: 63781 [2019-11-23 23:36:57,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:36:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63781 states. [2019-11-23 23:36:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63781 to 63781. [2019-11-23 23:36:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63781 states. [2019-11-23 23:36:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63781 states to 63781 states and 78017 transitions. [2019-11-23 23:36:59,070 INFO L78 Accepts]: Start accepts. Automaton has 63781 states and 78017 transitions. Word has length 213 [2019-11-23 23:36:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:36:59,071 INFO L462 AbstractCegarLoop]: Abstraction has 63781 states and 78017 transitions. [2019-11-23 23:36:59,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:36:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 63781 states and 78017 transitions. [2019-11-23 23:36:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-23 23:36:59,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:36:59,088 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:36:59,089 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:36:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:36:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -82805094, now seen corresponding path program 1 times [2019-11-23 23:36:59,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:36:59,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952578158] [2019-11-23 23:36:59,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:36:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 23:36:59,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952578158] [2019-11-23 23:36:59,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045312229] [2019-11-23 23:36:59,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:36:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:36:59,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:36:59,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:36:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:59,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:36:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:36:59,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:36:59,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:36:59,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344734099] [2019-11-23 23:36:59,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:36:59,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:36:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:36:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:36:59,801 INFO L87 Difference]: Start difference. First operand 63781 states and 78017 transitions. Second operand 3 states. [2019-11-23 23:37:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:01,008 INFO L93 Difference]: Finished difference Result 129992 states and 158904 transitions. [2019-11-23 23:37:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:37:01,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-23 23:37:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:01,096 INFO L225 Difference]: With dead ends: 129992 [2019-11-23 23:37:01,096 INFO L226 Difference]: Without dead ends: 66212 [2019-11-23 23:37:01,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:37:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66212 states. [2019-11-23 23:37:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66212 to 62780. [2019-11-23 23:37:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62780 states. [2019-11-23 23:37:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62780 states to 62780 states and 75194 transitions. [2019-11-23 23:37:02,129 INFO L78 Accepts]: Start accepts. Automaton has 62780 states and 75194 transitions. Word has length 221 [2019-11-23 23:37:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:02,130 INFO L462 AbstractCegarLoop]: Abstraction has 62780 states and 75194 transitions. [2019-11-23 23:37:02,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:37:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 62780 states and 75194 transitions. [2019-11-23 23:37:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-23 23:37:02,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:02,148 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:37:02,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:02,353 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash -583068520, now seen corresponding path program 1 times [2019-11-23 23:37:02,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:02,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713122576] [2019-11-23 23:37:02,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:37:02,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713122576] [2019-11-23 23:37:02,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793502241] [2019-11-23 23:37:02,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:03,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:37:03,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:37:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 23:37:03,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:37:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 23:37:03,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:37:03,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:37:03,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770225482] [2019-11-23 23:37:03,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:37:03,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:37:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:37:03,218 INFO L87 Difference]: Start difference. First operand 62780 states and 75194 transitions. Second operand 3 states. [2019-11-23 23:37:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:04,986 INFO L93 Difference]: Finished difference Result 138858 states and 166731 transitions. [2019-11-23 23:37:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:37:04,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-11-23 23:37:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:05,143 INFO L225 Difference]: With dead ends: 138858 [2019-11-23 23:37:05,144 INFO L226 Difference]: Without dead ends: 76079 [2019-11-23 23:37:05,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 521 SyntacticMatches, 3 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:37:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76079 states. [2019-11-23 23:37:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76079 to 76079. [2019-11-23 23:37:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-11-23 23:37:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 88268 transitions. [2019-11-23 23:37:08,658 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 88268 transitions. Word has length 262 [2019-11-23 23:37:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:08,658 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 88268 transitions. [2019-11-23 23:37:08,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:37:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 88268 transitions. [2019-11-23 23:37:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-23 23:37:08,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:08,685 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:37:08,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:08,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1796661537, now seen corresponding path program 1 times [2019-11-23 23:37:08,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:08,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265149840] [2019-11-23 23:37:08,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:37:09,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265149840] [2019-11-23 23:37:09,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:37:09,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:37:09,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891920740] [2019-11-23 23:37:09,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:37:09,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:37:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:37:09,252 INFO L87 Difference]: Start difference. First operand 76079 states and 88268 transitions. Second operand 3 states. [2019-11-23 23:37:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:10,706 INFO L93 Difference]: Finished difference Result 154159 states and 179597 transitions. [2019-11-23 23:37:10,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:37:10,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-23 23:37:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:10,819 INFO L225 Difference]: With dead ends: 154159 [2019-11-23 23:37:10,820 INFO L226 Difference]: Without dead ends: 78081 [2019-11-23 23:37:10,866 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:37:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78081 states. [2019-11-23 23:37:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78081 to 77223. [2019-11-23 23:37:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77223 states. [2019-11-23 23:37:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77223 states to 77223 states and 90124 transitions. [2019-11-23 23:37:12,252 INFO L78 Accepts]: Start accepts. Automaton has 77223 states and 90124 transitions. Word has length 271 [2019-11-23 23:37:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 77223 states and 90124 transitions. [2019-11-23 23:37:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:37:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 77223 states and 90124 transitions. [2019-11-23 23:37:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-23 23:37:12,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:12,268 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:37:12,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 135919026, now seen corresponding path program 1 times [2019-11-23 23:37:12,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:12,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676898172] [2019-11-23 23:37:12,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:37:12,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676898172] [2019-11-23 23:37:12,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524973343] [2019-11-23 23:37:12,650 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:37:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:12,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:37:12,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:37:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:37:13,269 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:37:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:37:13,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:37:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-11-23 23:37:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768748630] [2019-11-23 23:37:13,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:37:13,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:37:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:37:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:37:13,458 INFO L87 Difference]: Start difference. First operand 77223 states and 90124 transitions. Second operand 4 states. [2019-11-23 23:37:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:37:15,223 INFO L93 Difference]: Finished difference Result 171033 states and 198639 transitions. [2019-11-23 23:37:15,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:37:15,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-11-23 23:37:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:37:15,320 INFO L225 Difference]: With dead ends: 171033 [2019-11-23 23:37:15,321 INFO L226 Difference]: Without dead ends: 93811 [2019-11-23 23:37:15,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:37:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93811 states. [2019-11-23 23:37:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93811 to 81942. [2019-11-23 23:37:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81942 states. [2019-11-23 23:37:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81942 states to 81942 states and 94911 transitions. [2019-11-23 23:37:16,520 INFO L78 Accepts]: Start accepts. Automaton has 81942 states and 94911 transitions. Word has length 274 [2019-11-23 23:37:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:37:16,520 INFO L462 AbstractCegarLoop]: Abstraction has 81942 states and 94911 transitions. [2019-11-23 23:37:16,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:37:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 81942 states and 94911 transitions. [2019-11-23 23:37:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-23 23:37:16,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:37:16,535 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:37:16,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:37:16,740 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:37:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:37:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash -909805035, now seen corresponding path program 2 times [2019-11-23 23:37:16,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:37:16,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374722728] [2019-11-23 23:37:16,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:37:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:37:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 137 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:37:16,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374722728] [2019-11-23 23:37:16,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315416064] [2019-11-23 23:37:16,964 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:37:17,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-23 23:37:17,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 23:37:17,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 23:37:17,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:37:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:37:17,554 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:37:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:37:17,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594226367] [2019-11-23 23:37:17,811 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:37:17,812 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:37:17,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:37:17,842 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:37:17,843 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:37:19,370 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 160 [2019-11-23 23:37:20,194 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-11-23 23:37:34,164 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-11-23 23:37:34,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-11-23 23:37:34,310 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-11-23 23:37:41,854 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:37:42,987 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 213 DAG size of output: 182 [2019-11-23 23:37:44,149 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-11-23 23:37:45,306 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 213 DAG size of output: 184 [2019-11-23 23:37:45,765 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 153