java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:04,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:04,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:04,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:04,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:04,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:04,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:04,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:04,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:04,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:04,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:04,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:04,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:04,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:04,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:04,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:04,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:04,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:04,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:04,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:04,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:04,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:04,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:04,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:04,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:04,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:04,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:04,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:04,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:04,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:04,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:04,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:04,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:04,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:04,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:04,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:04,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:04,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:04,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:04,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:04,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:04,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:52:04,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:04,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:04,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:04,802 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:04,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:04,803 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:04,803 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:04,803 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:04,803 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:04,803 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:04,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:04,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:04,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:04,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:04,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:04,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:04,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:04,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:04,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:04,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:04,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:04,806 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:04,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:04,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:04,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:04,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:04,808 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:04,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:04,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:04,808 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:04,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:04,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:04,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:04,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:04,855 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:04,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-03 20:52:04,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a951f187c/e14352301aa941359a7d7e6001c53a18/FLAGe1bd1a2c6 [2019-09-03 20:52:05,333 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:05,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-03 20:52:05,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a951f187c/e14352301aa941359a7d7e6001c53a18/FLAGe1bd1a2c6 [2019-09-03 20:52:05,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a951f187c/e14352301aa941359a7d7e6001c53a18 [2019-09-03 20:52:05,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:05,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:05,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:05,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:05,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:05,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:05" (1/1) ... [2019-09-03 20:52:05,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566837db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:05, skipping insertion in model container [2019-09-03 20:52:05,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:05" (1/1) ... [2019-09-03 20:52:05,777 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:05,797 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:06,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:06,028 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:06,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:06,054 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:06,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06 WrapperNode [2019-09-03 20:52:06,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:06,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:06,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:06,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:06,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (1/1) ... [2019-09-03 20:52:06,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:06,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:06,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:06,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:06,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (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-09-03 20:52:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:06,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:06,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:06,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:06,447 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:06,448 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:52:06,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:06 BoogieIcfgContainer [2019-09-03 20:52:06,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:06,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:06,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:06,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:06,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:05" (1/3) ... [2019-09-03 20:52:06,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4fe38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:06, skipping insertion in model container [2019-09-03 20:52:06,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:06" (2/3) ... [2019-09-03 20:52:06,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4fe38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:06, skipping insertion in model container [2019-09-03 20:52:06,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:06" (3/3) ... [2019-09-03 20:52:06,480 INFO L109 eAbstractionObserver]: Analyzing ICFG half_2.i [2019-09-03 20:52:06,511 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:06,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:06,565 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:06,593 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:06,593 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:06,593 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:06,594 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:06,594 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:06,594 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:06,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:06,594 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-03 20:52:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:52:06,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,623 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash -351980134, now seen corresponding path program 1 times [2019-09-03 20:52:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:52:06,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:06,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:52:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:52:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:52:06,759 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-03 20:52:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,777 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-03 20:52:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:52:06,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 20:52:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,789 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:52:06,789 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:52:06,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:52:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:52:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:52:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:52:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:52:06,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-09-03 20:52:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,829 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:52:06,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:52:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:52:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:52:06,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,830 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 392972438, now seen corresponding path program 1 times [2019-09-03 20:52:06,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:07,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 20:52:07,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:07,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:07,020 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-09-03 20:52:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,214 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-03 20:52:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:07,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 20:52:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,216 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:52:07,216 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:52:07,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:52:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:52:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:52:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 20:52:07,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-03 20:52:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,223 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 20:52:07,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 20:52:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:52:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1474350191, now seen corresponding path program 1 times [2019-09-03 20:52:07,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:07,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:07,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 20:52:07,357 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [15], [17], [21], [30], [38], [41], [43], [49], [50], [51], [53] [2019-09-03 20:52:07,388 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:07,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:07,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:07,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:07,667 INFO L272 AbstractInterpreter]: Visited 14 different actions 46 times. Merged at 4 different actions 16 times. Widened at 1 different actions 2 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 11. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-03 20:52:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:07,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:07,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:07,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:07,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:07,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:07,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:07,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:07,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:08,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-03 20:52:08,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:08,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:08,073 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 11 states. [2019-09-03 20:52:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,210 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-09-03 20:52:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:08,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-09-03 20:52:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,211 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:52:08,212 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:52:08,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:52:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:52:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:52:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 20:52:08,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2019-09-03 20:52:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,217 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 20:52:08,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 20:52:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:52:08,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,218 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,218 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash 637322166, now seen corresponding path program 2 times [2019-09-03 20:52:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:08,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:08,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:08,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:08,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:08,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:08,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:52:08,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:08,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:08,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 20:52:08,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:08,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:08,471 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2019-09-03 20:52:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,582 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 20:52:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:08,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-09-03 20:52:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,586 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:52:08,586 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:52:08,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:52:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-09-03 20:52:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:52:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-03 20:52:08,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-09-03 20:52:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,604 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-03 20:52:08,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-03 20:52:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:52:08,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,606 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 326029073, now seen corresponding path program 1 times [2019-09-03 20:52:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:08,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-03 20:52:08,850 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [15], [17], [21], [30], [32], [38], [41], [43], [46], [48], [49], [50], [51], [53], [54] [2019-09-03 20:52:08,852 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:08,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:08,865 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:52:08,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:08,967 INFO L272 AbstractInterpreter]: Visited 18 different actions 84 times. Merged at 6 different actions 26 times. Widened at 2 different actions 4 times. Performed 148 root evaluator evaluations with a maximum evaluation depth of 11. Performed 148 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 6 fixpoints after 2 different actions. Largest state had 8 variables. [2019-09-03 20:52:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:08,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:08,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:52:09,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:52:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:09,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2019-09-03 20:52:09,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:09,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:09,545 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2019-09-03 20:52:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,870 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-03 20:52:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:09,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-03 20:52:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,873 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:52:09,873 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:52:09,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:52:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 20:52:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:52:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-03 20:52:09,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-09-03 20:52:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,879 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-03 20:52:09,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-03 20:52:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:52:09,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,880 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,880 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1130459304, now seen corresponding path program 2 times [2019-09-03 20:52:09,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:09,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:09,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:09,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:09,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:09,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:10,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:52:10,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:10,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:10,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:10,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:10,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:10,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:10,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:10,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 20 [2019-09-03 20:52:10,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:10,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:10,244 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 15 states. [2019-09-03 20:52:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,487 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 20:52:10,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:52:10,489 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-09-03 20:52:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,490 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:52:10,490 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:52:10,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:52:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-09-03 20:52:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:52:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-03 20:52:10,497 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2019-09-03 20:52:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,497 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-03 20:52:10,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-03 20:52:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:52:10,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,499 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,499 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1086392623, now seen corresponding path program 3 times [2019-09-03 20:52:10,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:10,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:10,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:10,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:10,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:10,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:10,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:52:10,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:10,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:52:11,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:11,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:52:11,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:11,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 31 [2019-09-03 20:52:11,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:11,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:11,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:11,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:11,434 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-09-03 20:52:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,911 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-09-03 20:52:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:11,912 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-03 20:52:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,913 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:52:11,916 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:52:11,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:52:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-09-03 20:52:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:52:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-03 20:52:11,922 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-09-03 20:52:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,922 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-03 20:52:11,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-03 20:52:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:52:11,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,923 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,924 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1121217930, now seen corresponding path program 4 times [2019-09-03 20:52:11,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:12,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:12,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:12,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:12,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:12,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:12,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 20:52:12,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:12,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:12,222 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2019-09-03 20:52:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,431 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-03 20:52:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:12,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-09-03 20:52:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,433 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:52:12,433 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:52:12,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:52:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-09-03 20:52:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:52:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-03 20:52:12,439 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 31 [2019-09-03 20:52:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,439 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-03 20:52:12,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-03 20:52:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:52:12,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,441 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,441 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -948049839, now seen corresponding path program 5 times [2019-09-03 20:52:12,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:12,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:12,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:12,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:12,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:12,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:12,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:12,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:12,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:13,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:52:13,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:13,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:52:13,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:13,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 37 [2019-09-03 20:52:13,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:13,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:13,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:52:13,564 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 26 states. [2019-09-03 20:52:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,083 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-09-03 20:52:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:14,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-09-03 20:52:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,086 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:52:14,086 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:52:14,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:52:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-09-03 20:52:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:52:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-03 20:52:14,093 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-09-03 20:52:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,093 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-03 20:52:14,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-03 20:52:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:52:14,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:14,094 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:14,095 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -129353064, now seen corresponding path program 6 times [2019-09-03 20:52:14,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:14,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:14,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:14,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:14,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:14,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:14,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:14,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:52:14,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:14,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:52:14,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:14,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 28 [2019-09-03 20:52:14,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:14,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:14,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:14,581 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2019-09-03 20:52:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,962 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-03 20:52:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:52:14,963 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-09-03 20:52:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,964 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:52:14,964 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:52:14,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:52:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:52:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-03 20:52:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:52:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-03 20:52:14,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 39 [2019-09-03 20:52:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,976 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-03 20:52:14,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-03 20:52:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:52:14,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:14,982 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:14,982 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash -379409, now seen corresponding path program 7 times [2019-09-03 20:52:14,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:15,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:15,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:15,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:15,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:15,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:52:15,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:52:15,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:15,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:52:16,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:16,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 42 [2019-09-03 20:52:16,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:16,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:52:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:52:16,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:52:16,367 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 29 states. [2019-09-03 20:52:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:17,039 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-03 20:52:17,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:17,040 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-09-03 20:52:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:17,042 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:52:17,042 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:52:17,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=339, Invalid=2111, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:52:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:52:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-09-03 20:52:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:52:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-03 20:52:17,049 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-09-03 20:52:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:17,049 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-03 20:52:17,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:52:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-03 20:52:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:52:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:17,050 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:17,051 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1353756362, now seen corresponding path program 8 times [2019-09-03 20:52:17,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:17,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:17,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:17,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:17,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:17,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:17,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:17,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:17,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:17,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:17,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:17,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 20:52:17,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:17,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:52:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:52:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:17,512 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2019-09-03 20:52:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:17,844 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 20:52:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:17,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-09-03 20:52:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:17,846 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:52:17,846 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:52:17,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:52:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:52:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-09-03 20:52:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:52:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-03 20:52:17,852 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 47 [2019-09-03 20:52:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:17,853 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-03 20:52:17,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:52:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-03 20:52:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:52:17,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:17,854 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:17,854 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1070984815, now seen corresponding path program 9 times [2019-09-03 20:52:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:18,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:18,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:18,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:18,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:18,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:18,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:18,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:18,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:18,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:52:18,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:18,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 20:52:18,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:18,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:18,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:52:18,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:19,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:19,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 47 [2019-09-03 20:52:19,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:19,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:52:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:52:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:52:19,731 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 32 states. [2019-09-03 20:52:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:20,572 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-09-03 20:52:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:20,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2019-09-03 20:52:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:20,575 INFO L225 Difference]: With dead ends: 108 [2019-09-03 20:52:20,575 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:52:20,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=417, Invalid=2663, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:52:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:52:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-09-03 20:52:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:52:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-03 20:52:20,582 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-09-03 20:52:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:20,582 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-03 20:52:20,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:52:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-03 20:52:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 20:52:20,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:20,583 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:20,584 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1590757928, now seen corresponding path program 10 times [2019-09-03 20:52:20,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:20,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:20,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 31 proven. 47 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:20,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:20,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:20,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:20,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:20,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:20,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:20,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:52:20,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:20,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:21,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:21,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 20:52:21,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:21,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:52:21,251 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 26 states. [2019-09-03 20:52:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:21,658 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-03 20:52:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:21,658 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-09-03 20:52:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:21,660 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:52:21,660 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 20:52:21,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:52:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 20:52:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-03 20:52:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:52:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-03 20:52:21,667 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 55 [2019-09-03 20:52:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:21,667 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-03 20:52:21,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-03 20:52:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:52:21,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:21,669 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:21,669 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1029156177, now seen corresponding path program 11 times [2019-09-03 20:52:21,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:21,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 57 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:22,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:22,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:22,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:22,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:22,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:22,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:22,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:22,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:22,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:52:22,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:22,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 101 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:52:22,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:22,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:52:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 101 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:52:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:23,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 54 [2019-09-03 20:52:23,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:23,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:52:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:52:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2474, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:52:23,778 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 37 states. [2019-09-03 20:52:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:24,669 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-09-03 20:52:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:52:24,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2019-09-03 20:52:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:24,671 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:52:24,672 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:52:24,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=534, Invalid=3498, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:52:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2019-09-03 20:52:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:52:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-03 20:52:24,679 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-09-03 20:52:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:24,679 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-03 20:52:24,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:52:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-03 20:52:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:52:24,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:24,680 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:24,681 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1904476150, now seen corresponding path program 12 times [2019-09-03 20:52:24,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:24,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:24,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 40 proven. 65 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:24,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:24,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:24,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:24,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:24,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:24,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:24,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:24,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:24,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:24,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:24,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:52:24,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:25,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 11 proven. 109 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:52:25,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:25,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 11 proven. 109 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:52:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:25,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 40 [2019-09-03 20:52:25,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:25,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:52:25,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:52:25,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:25,609 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 30 states. [2019-09-03 20:52:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:26,267 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-03 20:52:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:52:26,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 63 [2019-09-03 20:52:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:26,269 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:52:26,269 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 20:52:26,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=533, Invalid=2547, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:52:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 20:52:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-09-03 20:52:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:52:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-03 20:52:26,275 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 63 [2019-09-03 20:52:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:26,276 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-03 20:52:26,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:52:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-03 20:52:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:52:26,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:26,277 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:26,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash -791196975, now seen corresponding path program 13 times [2019-09-03 20:52:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:26,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:26,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:26,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:26,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 77 proven. 50 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:26,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:26,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:26,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:26,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:26,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:26,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:26,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:26,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:26,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:52:26,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:52:27,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:27,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:27,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:28,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:28,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:52:28,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:28,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 53 [2019-09-03 20:52:28,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:28,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:52:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:52:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:52:28,504 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 34 states. [2019-09-03 20:52:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:29,511 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2019-09-03 20:52:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:29,512 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-03 20:52:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:29,513 INFO L225 Difference]: With dead ends: 138 [2019-09-03 20:52:29,514 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:52:29,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=557, Invalid=3475, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:52:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2019-09-03 20:52:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:52:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-03 20:52:29,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2019-09-03 20:52:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:29,520 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-03 20:52:29,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:52:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-03 20:52:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-03 20:52:29,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:29,522 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:29,522 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:29,522 INFO L82 PathProgramCache]: Analyzing trace with hash -760168168, now seen corresponding path program 14 times [2019-09-03 20:52:29,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:29,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 50 proven. 86 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:29,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:29,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:29,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:29,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:29,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:29,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:52:29,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:29,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:52:29,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 14 proven. 122 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:30,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 14 proven. 122 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:30,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 20:52:30,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:30,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:52:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:52:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:52:30,386 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 32 states. [2019-09-03 20:52:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,038 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-03 20:52:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:31,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-09-03 20:52:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,040 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:52:31,040 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:52:31,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 115 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=615, Invalid=2577, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:52:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:52:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-09-03 20:52:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:52:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-03 20:52:31,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 71 [2019-09-03 20:52:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,047 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-03 20:52:31,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:52:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-03 20:52:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:52:31,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,048 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,048 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1796776081, now seen corresponding path program 15 times [2019-09-03 20:52:31,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 100 proven. 61 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:31,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:31,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:31,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:31,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:31,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:31,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:52:31,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 20:52:32,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 20:52:33,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 58 [2019-09-03 20:52:33,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:52:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:52:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2846, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:52:33,445 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 37 states. [2019-09-03 20:52:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:34,590 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2019-09-03 20:52:34,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:34,591 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-03 20:52:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:34,592 INFO L225 Difference]: With dead ends: 153 [2019-09-03 20:52:34,592 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 20:52:34,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=653, Invalid=4177, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:52:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 20:52:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-09-03 20:52:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:52:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-03 20:52:34,598 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2019-09-03 20:52:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:34,598 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-03 20:52:34,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:52:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-03 20:52:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:52:34,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:34,599 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:34,600 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:34,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1474666166, now seen corresponding path program 16 times [2019-09-03 20:52:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 61 proven. 110 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:34,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:34,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 16 proven. 155 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:35,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 16 proven. 155 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:35,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-03 20:52:35,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:52:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:52:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1645, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:52:35,452 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 35 states. [2019-09-03 20:52:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:36,176 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-03 20:52:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:52:36,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 79 [2019-09-03 20:52:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:36,178 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:52:36,178 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:52:36,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 128 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=748, Invalid=3158, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:52:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:52:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-03 20:52:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:52:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-03 20:52:36,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-09-03 20:52:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:36,185 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-03 20:52:36,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:52:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-03 20:52:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:52:36,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:36,186 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:36,187 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash 233411601, now seen corresponding path program 17 times [2019-09-03 20:52:36,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 126 proven. 73 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:37,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:37,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:37,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:37,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:37,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:37,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:52:37,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:37,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:52:37,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:37,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:37,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:37,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:37,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 41 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:52:38,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:38,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:52:38,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 41 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:52:39,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 72 [2019-09-03 20:52:39,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:52:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:52:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=4444, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:52:39,345 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 49 states. [2019-09-03 20:52:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:40,986 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-09-03 20:52:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:40,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 86 [2019-09-03 20:52:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:40,988 INFO L225 Difference]: With dead ends: 168 [2019-09-03 20:52:40,988 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:52:40,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=898, Invalid=6242, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:52:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:52:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2019-09-03 20:52:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 20:52:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-03 20:52:40,994 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2019-09-03 20:52:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:40,994 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-03 20:52:40,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:52:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-03 20:52:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:52:40,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:40,996 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:40,996 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -382493608, now seen corresponding path program 18 times [2019-09-03 20:52:40,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:41,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 73 proven. 137 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:41,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:41,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:41,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:41,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:41,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:41,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:41,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:41,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:41,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:41,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:52:41,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:41,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 17 proven. 217 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:52:41,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:41,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:41,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 17 proven. 217 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:52:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27] total 52 [2019-09-03 20:52:42,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:42,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:52:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:52:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2247, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:52:42,313 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 39 states. [2019-09-03 20:52:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:43,248 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-03 20:52:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:52:43,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 87 [2019-09-03 20:52:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:43,252 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:52:43,252 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:52:43,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 137 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=938, Invalid=4464, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:52:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:52:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-03 20:52:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:52:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-03 20:52:43,257 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 87 [2019-09-03 20:52:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:43,258 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-03 20:52:43,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:52:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-03 20:52:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:52:43,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:43,259 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:43,259 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash 567499823, now seen corresponding path program 19 times [2019-09-03 20:52:43,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:44,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:44,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:44,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:44,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:44,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:44,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:44,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:52:44,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:44,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 19 proven. 249 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-03 20:52:44,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:44,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:52:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 19 proven. 249 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-03 20:52:46,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:46,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 30] total 68 [2019-09-03 20:52:46,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:46,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:52:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:52:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=3916, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:52:46,084 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 43 states. [2019-09-03 20:52:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:47,617 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2019-09-03 20:52:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:52:47,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 94 [2019-09-03 20:52:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:47,618 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:52:47,618 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:52:47,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=893, Invalid=5749, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:52:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:52:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2019-09-03 20:52:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 20:52:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-09-03 20:52:47,624 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2019-09-03 20:52:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:47,624 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-09-03 20:52:47,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:52:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-09-03 20:52:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-03 20:52:47,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:47,625 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:47,626 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1435512182, now seen corresponding path program 20 times [2019-09-03 20:52:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 86 proven. 167 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:47,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:47,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:47,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:47,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:47,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:47,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:47,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:47,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:52:47,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:47,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:52:47,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:48,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:48,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 20:52:48,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:48,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:52:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:52:48,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2296, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:52:48,802 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 41 states. [2019-09-03 20:52:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:49,753 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-03 20:52:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:49,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 95 [2019-09-03 20:52:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:49,756 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:52:49,756 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:52:49,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 154 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1053, Invalid=4497, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:52:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:52:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-09-03 20:52:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:52:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-03 20:52:49,760 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 95 [2019-09-03 20:52:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:49,761 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-03 20:52:49,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:52:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-03 20:52:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:52:49,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:49,762 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:49,762 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 214232401, now seen corresponding path program 21 times [2019-09-03 20:52:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:50,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:50,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:50,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:50,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:50,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:50,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:50,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:50,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:52:50,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:51,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 51 proven. 266 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-03 20:52:51,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:51,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:52,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 51 proven. 266 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-03 20:52:53,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 73 [2019-09-03 20:52:53,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:53,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:52:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:52:53,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=4529, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:52:53,245 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 46 states. [2019-09-03 20:52:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,900 INFO L93 Difference]: Finished difference Result 198 states and 203 transitions. [2019-09-03 20:52:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:52:54,900 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 102 [2019-09-03 20:52:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,902 INFO L225 Difference]: With dead ends: 198 [2019-09-03 20:52:54,902 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:52:54,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1013, Invalid=6643, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:52:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:52:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-09-03 20:52:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 20:52:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-03 20:52:54,907 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2019-09-03 20:52:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,907 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-03 20:52:54,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:52:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-03 20:52:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 20:52:54,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,909 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,909 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1038383208, now seen corresponding path program 22 times [2019-09-03 20:52:54,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 100 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:55,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:55,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:55,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:55,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:52:55,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:55,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 22 proven. 278 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:55,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 22 proven. 278 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:56,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:56,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 20:52:56,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:56,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:52:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:52:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=2662, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:52:56,207 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 44 states. [2019-09-03 20:52:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,241 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-03 20:52:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:57,241 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 103 [2019-09-03 20:52:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,243 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:52:57,243 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 20:52:57,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=5255, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:52:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 20:52:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-09-03 20:52:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:52:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-09-03 20:52:57,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 103 [2019-09-03 20:52:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,251 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-09-03 20:52:57,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:52:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-09-03 20:52:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:52:57,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,252 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:57,252 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1938311407, now seen corresponding path program 23 times [2019-09-03 20:52:57,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 222 proven. 115 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:58,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:58,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:58,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:58,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:58,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:58,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:52:58,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:58,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:59,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 56 proven. 314 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:52:59,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:53:00,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:53:00,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:00,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 56 proven. 314 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:53:01,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:01,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 34] total 90 [2019-09-03 20:53:01,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:01,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:53:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:53:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=6976, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:53:01,810 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 61 states. [2019-09-03 20:53:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,096 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2019-09-03 20:53:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:04,097 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 110 [2019-09-03 20:53:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,098 INFO L225 Difference]: With dead ends: 213 [2019-09-03 20:53:04,098 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 20:53:04,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 160 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3298 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1366, Invalid=9764, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:53:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 20:53:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2019-09-03 20:53:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 20:53:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-03 20:53:04,103 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2019-09-03 20:53:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,104 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-03 20:53:04,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:53:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-03 20:53:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 20:53:04,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,105 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,105 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1130386378, now seen corresponding path program 24 times [2019-09-03 20:53:04,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 115 proven. 236 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:53:04,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:04,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:04,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:04,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:04,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:04,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:04,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 23 proven. 361 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:53:05,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 23 proven. 361 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:53:06,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:06,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 33] total 64 [2019-09-03 20:53:06,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:06,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:53:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:53:06,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=3417, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:53:06,088 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 48 states. [2019-09-03 20:53:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,438 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-03 20:53:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:53:07,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-09-03 20:53:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,441 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:53:07,441 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 20:53:07,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 176 SyntacticMatches, 14 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1460, Invalid=6912, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:53:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 20:53:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-09-03 20:53:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:53:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-09-03 20:53:07,446 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 111 [2019-09-03 20:53:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,447 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-09-03 20:53:07,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:53:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-09-03 20:53:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:53:07,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,448 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,448 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash 600659601, now seen corresponding path program 25 times [2019-09-03 20:53:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 260 proven. 131 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:53:08,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:08,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:08,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:53:08,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 25 proven. 402 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-03 20:53:09,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:09,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:10,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 25 proven. 402 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-03 20:53:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 36] total 83 [2019-09-03 20:53:11,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:53:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:53:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=952, Invalid=5854, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:53:11,579 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 52 states. [2019-09-03 20:53:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:13,629 INFO L93 Difference]: Finished difference Result 228 states and 233 transitions. [2019-09-03 20:53:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:13,629 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 118 [2019-09-03 20:53:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:13,631 INFO L225 Difference]: With dead ends: 228 [2019-09-03 20:53:13,631 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 20:53:13,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 186 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1310, Invalid=8590, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:53:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 20:53:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2019-09-03 20:53:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:53:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-03 20:53:13,638 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2019-09-03 20:53:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,638 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-03 20:53:13,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:53:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-03 20:53:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 20:53:13,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,639 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,639 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash -70483240, now seen corresponding path program 26 times [2019-09-03 20:53:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 131 proven. 275 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:53:14,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:14,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:14,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:14,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:14,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:53:14,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:14,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:14,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:53:14,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:53:15,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 20:53:15,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:15,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:53:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:53:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=3475, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:53:15,318 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 50 states. [2019-09-03 20:53:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:16,704 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-03 20:53:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:53:16,705 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2019-09-03 20:53:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:16,706 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:53:16,706 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:53:16,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 193 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1608, Invalid=6948, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:53:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:53:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-03 20:53:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:53:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-09-03 20:53:16,713 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2019-09-03 20:53:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:16,713 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-09-03 20:53:16,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:53:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-09-03 20:53:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:53:16,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:16,714 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:16,714 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:16,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1289607761, now seen corresponding path program 27 times [2019-09-03 20:53:16,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 301 proven. 148 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:53:18,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:18,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:18,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:18,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:18,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:18,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:18,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:18,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:18,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:53:18,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:18,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:18,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:18,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 66 proven. 422 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-03 20:53:19,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:19,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:19,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:20,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:20,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 66 proven. 422 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-03 20:53:21,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:21,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 88 [2019-09-03 20:53:21,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:21,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:53:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:53:21,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6599, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:53:21,332 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 55 states. [2019-09-03 20:53:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:23,726 INFO L93 Difference]: Finished difference Result 243 states and 248 transitions. [2019-09-03 20:53:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:23,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 126 [2019-09-03 20:53:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:23,728 INFO L225 Difference]: With dead ends: 243 [2019-09-03 20:53:23,728 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 20:53:23,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1454, Invalid=9676, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:53:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 20:53:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2019-09-03 20:53:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:53:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-03 20:53:23,733 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2019-09-03 20:53:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:23,734 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-03 20:53:23,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:53:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-03 20:53:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:53:23,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:23,735 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:23,735 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:23,735 INFO L82 PathProgramCache]: Analyzing trace with hash -30401802, now seen corresponding path program 28 times [2019-09-03 20:53:23,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:23,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 148 proven. 317 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:53:24,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:24,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:24,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:24,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:24,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:24,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:53:24,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:24,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 28 proven. 437 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:53:24,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 28 proven. 437 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:53:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-03 20:53:25,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:25,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:53:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:53:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=3922, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:53:25,588 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 53 states. [2019-09-03 20:53:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:27,360 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-03 20:53:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:27,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 127 [2019-09-03 20:53:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:27,362 INFO L225 Difference]: With dead ends: 141 [2019-09-03 20:53:27,362 INFO L226 Difference]: Without dead ends: 141 [2019-09-03 20:53:27,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 206 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3170 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1819, Invalid=7883, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:53:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-03 20:53:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-09-03 20:53:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 20:53:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-09-03 20:53:27,373 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 127 [2019-09-03 20:53:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:27,374 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-09-03 20:53:27,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:53:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-09-03 20:53:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 20:53:27,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:27,377 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:27,377 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1436102703, now seen corresponding path program 29 times [2019-09-03 20:53:27,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 345 proven. 166 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:53:28,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:28,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:28,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:28,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:28,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:28,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:28,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:53:28,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:28,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:53:28,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:30,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:30,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 71 proven. 482 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-03 20:53:30,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:31,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:32,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:32,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:32,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:32,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 71 proven. 482 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:33,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 40] total 108 [2019-09-03 20:53:33,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:33,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:53:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:53:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=10075, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:53:33,569 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 73 states. [2019-09-03 20:53:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:37,290 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2019-09-03 20:53:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:37,291 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 134 [2019-09-03 20:53:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:37,293 INFO L225 Difference]: With dead ends: 258 [2019-09-03 20:53:37,293 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 20:53:37,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1933, Invalid=14069, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:53:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 20:53:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2019-09-03 20:53:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 20:53:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-03 20:53:37,299 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2019-09-03 20:53:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:37,300 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-03 20:53:37,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:53:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-03 20:53:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-03 20:53:37,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:37,301 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:37,301 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash 900369944, now seen corresponding path program 30 times [2019-09-03 20:53:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:37,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:37,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:37,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 166 proven. 362 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:53:37,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:37,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:37,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:37,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:37,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:37,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:37,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:37,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:37,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:53:37,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:38,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 29 proven. 541 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-03 20:53:38,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 29 proven. 541 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-03 20:53:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:39,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 39] total 76 [2019-09-03 20:53:39,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:39,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:53:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:53:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=4830, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:39,475 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 57 states. [2019-09-03 20:53:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:41,257 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-03 20:53:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:53:41,258 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 135 [2019-09-03 20:53:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:41,260 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:53:41,260 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 20:53:41,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 215 SyntacticMatches, 17 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3951 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2099, Invalid=9891, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:53:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 20:53:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-09-03 20:53:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:53:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-03 20:53:41,266 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 135 [2019-09-03 20:53:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:41,266 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-03 20:53:41,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:53:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-03 20:53:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:53:41,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:41,268 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:41,268 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash -390270353, now seen corresponding path program 31 times [2019-09-03 20:53:41,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 392 proven. 185 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:42,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:42,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:42,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:42,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:42,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:42,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:42,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:53:42,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:44,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 31 proven. 591 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-03 20:53:44,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:44,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:53:45,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:45,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 31 proven. 591 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-03 20:53:46,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:46,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 98 [2019-09-03 20:53:46,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:46,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:53:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:53:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=8179, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:53:46,927 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 61 states. [2019-09-03 20:53:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:49,440 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2019-09-03 20:53:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:53:49,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 142 [2019-09-03 20:53:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:49,442 INFO L225 Difference]: With dead ends: 273 [2019-09-03 20:53:49,443 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 20:53:49,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3415 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1808, Invalid=11998, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:53:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 20:53:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-09-03 20:53:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 20:53:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-03 20:53:49,449 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2019-09-03 20:53:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:49,450 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-03 20:53:49,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:53:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-03 20:53:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 20:53:49,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:49,451 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:49,451 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1784510902, now seen corresponding path program 32 times [2019-09-03 20:53:49,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 185 proven. 410 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:49,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:49,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:50,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:53:50,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:50,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:53:50,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:50,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 32 proven. 563 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:50,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 32 proven. 563 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:53:51,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:51,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-09-03 20:53:51,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:51,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:53:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:53:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4897, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:53:51,598 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 59 states. [2019-09-03 20:53:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:53,560 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-09-03 20:53:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:53:53,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2019-09-03 20:53:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:53,562 INFO L225 Difference]: With dead ends: 157 [2019-09-03 20:53:53,562 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 20:53:53,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 232 SyntacticMatches, 17 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4034 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2280, Invalid=9930, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:53:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 20:53:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-03 20:53:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 20:53:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-09-03 20:53:53,568 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 143 [2019-09-03 20:53:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:53,569 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-09-03 20:53:53,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:53:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-09-03 20:53:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:53:53,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:53,570 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:53,570 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 955603217, now seen corresponding path program 33 times [2019-09-03 20:53:53,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 442 proven. 205 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:53:55,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:55,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:55,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:55,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:55,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:55,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:55,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:55,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:55,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:55,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 20:53:55,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:56,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:56,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:56,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:56,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 81 proven. 614 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-03 20:53:56,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:56,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:58,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:58,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:58,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 81 proven. 614 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-03 20:53:59,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:59,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44, 44] total 103 [2019-09-03 20:53:59,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:59,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:53:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:53:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1450, Invalid=9056, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:53:59,802 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 64 states. [2019-09-03 20:54:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:02,793 INFO L93 Difference]: Finished difference Result 288 states and 293 transitions. [2019-09-03 20:54:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:54:02,794 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-09-03 20:54:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:02,796 INFO L225 Difference]: With dead ends: 288 [2019-09-03 20:54:02,796 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 20:54:02,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3746 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1976, Invalid=13276, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:54:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 20:54:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2019-09-03 20:54:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:54:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-03 20:54:02,802 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2019-09-03 20:54:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:02,803 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-03 20:54:02,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:54:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-03 20:54:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 20:54:02,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:02,804 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:02,804 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1343859032, now seen corresponding path program 34 times [2019-09-03 20:54:02,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:02,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:02,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 205 proven. 461 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:54:03,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:03,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:03,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:03,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:03,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:03,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:54:03,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:04,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 34 proven. 632 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:54:04,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 34 proven. 632 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:54:05,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:05,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-09-03 20:54:05,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:05,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:54:05,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:54:05,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=5425, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:54:05,284 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 62 states. [2019-09-03 20:54:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:07,538 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2019-09-03 20:54:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:54:07,539 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 151 [2019-09-03 20:54:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:07,540 INFO L225 Difference]: With dead ends: 165 [2019-09-03 20:54:07,541 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 20:54:07,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 245 SyntacticMatches, 18 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4505 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2530, Invalid=11042, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:54:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 20:54:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-09-03 20:54:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 20:54:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-09-03 20:54:07,547 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 151 [2019-09-03 20:54:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:07,547 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-09-03 20:54:07,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:54:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-09-03 20:54:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 20:54:07,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:07,549 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:07,549 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1149980881, now seen corresponding path program 35 times [2019-09-03 20:54:07,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:07,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:07,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 495 proven. 226 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:54:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:09,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:09,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:09,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:09,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:09,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:09,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 20:54:09,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:09,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:54:09,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:11,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:11,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:11,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 35 proven. 737 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 20:54:12,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 35 proven. 737 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 20:54:15,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:15,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 126 [2019-09-03 20:54:15,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:15,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:54:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:54:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=13724, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:54:15,617 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 85 states. [2019-09-03 20:54:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:20,418 INFO L93 Difference]: Finished difference Result 303 states and 308 transitions. [2019-09-03 20:54:20,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:54:20,419 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 158 [2019-09-03 20:54:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:20,421 INFO L225 Difference]: With dead ends: 303 [2019-09-03 20:54:20,421 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 20:54:20,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 232 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6616 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2616, Invalid=19140, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:54:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 20:54:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2019-09-03 20:54:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 20:54:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-03 20:54:20,427 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2019-09-03 20:54:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:20,427 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-03 20:54:20,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:54:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-03 20:54:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 20:54:20,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:20,428 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:20,429 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -263993226, now seen corresponding path program 36 times [2019-09-03 20:54:20,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:20,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 226 proven. 515 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:54:21,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:21,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:21,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:21,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:21,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:21,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:21,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:21,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:21,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:21,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:54:21,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 35 proven. 757 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 20:54:22,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:22,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:22,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 35 proven. 757 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 20:54:23,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:23,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45, 45] total 88 [2019-09-03 20:54:23,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:23,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:54:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:54:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1170, Invalid=6486, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:54:23,265 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 66 states. [2019-09-03 20:54:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:25,784 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-09-03 20:54:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:54:25,784 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 159 [2019-09-03 20:54:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:25,786 INFO L225 Difference]: With dead ends: 173 [2019-09-03 20:54:25,786 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 20:54:25,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 254 SyntacticMatches, 20 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2855, Invalid=13401, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:54:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 20:54:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-03 20:54:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 20:54:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-03 20:54:25,791 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 159 [2019-09-03 20:54:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:25,791 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-03 20:54:25,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:54:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-03 20:54:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 20:54:25,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:25,793 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:25,793 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -388173231, now seen corresponding path program 37 times [2019-09-03 20:54:25,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 551 proven. 248 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:54:27,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:27,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:27,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:27,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:27,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:54:28,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:29,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 37 proven. 816 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:54:29,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:29,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:29,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:30,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:31,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:31,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 37 proven. 816 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:54:33,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:33,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48, 48] total 113 [2019-09-03 20:54:33,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:33,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:54:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:54:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=10891, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:54:33,088 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 70 states. [2019-09-03 20:54:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:36,718 INFO L93 Difference]: Finished difference Result 318 states and 323 transitions. [2019-09-03 20:54:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:54:36,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-09-03 20:54:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:36,720 INFO L225 Difference]: With dead ends: 318 [2019-09-03 20:54:36,720 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 20:54:36,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 264 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4555 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2387, Invalid=15973, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:54:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 20:54:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2019-09-03 20:54:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 20:54:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-03 20:54:36,727 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 166 [2019-09-03 20:54:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:36,727 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-03 20:54:36,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:54:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-03 20:54:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 20:54:36,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:36,728 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:36,729 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1401039720, now seen corresponding path program 38 times [2019-09-03 20:54:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 248 proven. 572 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:54:37,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:37,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:37,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:37,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:37,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:38,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 20:54:38,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:38,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:54:38,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 38 proven. 782 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:54:39,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 38 proven. 782 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:54:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-09-03 20:54:40,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:40,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:54:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:54:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1270, Invalid=6562, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:54:40,486 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 68 states. [2019-09-03 20:54:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:42,834 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2019-09-03 20:54:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:54:42,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 167 [2019-09-03 20:54:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:42,837 INFO L225 Difference]: With dead ends: 181 [2019-09-03 20:54:42,837 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 20:54:42,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 271 SyntacticMatches, 20 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5525 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3069, Invalid=13443, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:54:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 20:54:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-09-03 20:54:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 20:54:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-09-03 20:54:42,844 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 167 [2019-09-03 20:54:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:42,844 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-09-03 20:54:42,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:54:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-09-03 20:54:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 20:54:42,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:42,846 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:42,846 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash 828726255, now seen corresponding path program 39 times [2019-09-03 20:54:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:42,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:42,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 610 proven. 271 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:54:45,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:45,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:45,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:45,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:45,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:45,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:45,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:45,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:45,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:45,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:45,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 20:54:45,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 96 proven. 842 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-03 20:54:46,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:46,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:54:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:47,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 96 proven. 842 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-03 20:54:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50, 50] total 118 [2019-09-03 20:54:50,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:50,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:54:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:54:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1906, Invalid=11900, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:54:50,569 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 73 states. [2019-09-03 20:54:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:54,270 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2019-09-03 20:54:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:54:54,271 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 174 [2019-09-03 20:54:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:54,272 INFO L225 Difference]: With dead ends: 333 [2019-09-03 20:54:54,272 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 20:54:54,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 277 SyntacticMatches, 3 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4934 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2579, Invalid=17443, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:54:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 20:54:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2019-09-03 20:54:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 20:54:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-03 20:54:54,277 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 174 [2019-09-03 20:54:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:54,278 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-03 20:54:54,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:54:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-03 20:54:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 20:54:54,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:54,279 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:54,279 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -570489034, now seen corresponding path program 40 times [2019-09-03 20:54:54,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:54,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 271 proven. 632 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:54:55,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:55,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:55,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:55,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:55,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:55,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:55,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:55,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:55,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:55,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:56,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 40 proven. 863 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:54:56,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 40 proven. 863 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:54:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-09-03 20:54:57,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:57,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:54:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:54:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=7171, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:54:57,332 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 71 states. [2019-09-03 20:55:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:00,024 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-09-03 20:55:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:55:00,025 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 175 [2019-09-03 20:55:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:00,026 INFO L225 Difference]: With dead ends: 189 [2019-09-03 20:55:00,027 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 20:55:00,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 284 SyntacticMatches, 21 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6074 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3358, Invalid=14732, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:55:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 20:55:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-09-03 20:55:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 20:55:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-09-03 20:55:00,032 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 175 [2019-09-03 20:55:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:00,032 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-09-03 20:55:00,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:55:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-09-03 20:55:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 20:55:00,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:00,033 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:00,034 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1803445359, now seen corresponding path program 41 times [2019-09-03 20:55:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:00,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:00,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 672 proven. 295 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:55:02,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:02,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:02,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:02,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:02,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:02,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:02,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:02,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:02,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 20:55:02,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:02,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:55:02,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:05,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 101 proven. 926 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-03 20:55:05,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:06,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:55:06,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:06,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:07,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:08,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:08,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:08,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 101 proven. 926 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-03 20:55:10,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:10,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52, 52] total 144 [2019-09-03 20:55:10,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:10,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:55:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:55:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2618, Invalid=17974, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:55:10,380 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 97 states. [2019-09-03 20:55:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:15,486 INFO L93 Difference]: Finished difference Result 348 states and 353 transitions. [2019-09-03 20:55:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:55:15,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 182 [2019-09-03 20:55:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:15,488 INFO L225 Difference]: With dead ends: 348 [2019-09-03 20:55:15,488 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 20:55:15,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 268 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8644 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3364, Invalid=25028, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:55:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 20:55:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2019-09-03 20:55:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 20:55:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-03 20:55:15,494 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 182 [2019-09-03 20:55:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:15,494 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-03 20:55:15,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:55:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-03 20:55:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 20:55:15,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:15,496 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:15,496 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1832587224, now seen corresponding path program 42 times [2019-09-03 20:55:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:15,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:15,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:15,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 295 proven. 695 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:55:16,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:16,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:16,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:16,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:16,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:16,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:16,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:16,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:16,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:16,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:16,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:17,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 41 proven. 1009 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-03 20:55:17,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 41 proven. 1009 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-03 20:55:19,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:19,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 51, 51] total 100 [2019-09-03 20:55:19,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:19,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:55:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:55:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=8385, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:55:19,119 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 75 states. [2019-09-03 20:55:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:22,075 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2019-09-03 20:55:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:55:22,075 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2019-09-03 20:55:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:22,077 INFO L225 Difference]: With dead ends: 197 [2019-09-03 20:55:22,077 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 20:55:22,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 293 SyntacticMatches, 23 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7143 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3728, Invalid=17442, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:55:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 20:55:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2019-09-03 20:55:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 20:55:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-09-03 20:55:22,083 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 183 [2019-09-03 20:55:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:22,083 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-09-03 20:55:22,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:55:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-09-03 20:55:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 20:55:22,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:22,084 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:22,084 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1873475759, now seen corresponding path program 43 times [2019-09-03 20:55:22,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 737 proven. 320 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:55:24,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:24,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:24,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:24,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:24,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:24,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:24,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 20:55:24,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:26,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 43 proven. 1077 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-03 20:55:26,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:26,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:27,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:28,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 43 proven. 1077 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-03 20:55:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54, 54] total 128 [2019-09-03 20:55:30,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:30,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:55:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:55:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2266, Invalid=13990, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:55:30,987 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 79 states. [2019-09-03 20:55:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:35,612 INFO L93 Difference]: Finished difference Result 363 states and 368 transitions. [2019-09-03 20:55:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:55:35,613 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 190 [2019-09-03 20:55:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:35,614 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:55:35,614 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 20:55:35,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5857 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3047, Invalid=20515, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:55:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 20:55:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-09-03 20:55:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 20:55:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-03 20:55:35,622 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 190 [2019-09-03 20:55:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:35,622 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-03 20:55:35,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:55:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-03 20:55:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 20:55:35,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:35,624 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:35,624 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1599392266, now seen corresponding path program 44 times [2019-09-03 20:55:35,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:35,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:35,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 320 proven. 761 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:55:36,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:36,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:36,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:36,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:36,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:36,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:36,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:36,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 20:55:36,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:36,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:55:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:37,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 44 proven. 1037 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:55:37,743 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 44 proven. 1037 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:55:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:39,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-09-03 20:55:39,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:39,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:55:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:55:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1630, Invalid=8470, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:55:39,171 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 77 states. [2019-09-03 20:55:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:42,334 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2019-09-03 20:55:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:55:42,335 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 191 [2019-09-03 20:55:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:42,336 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:55:42,336 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 20:55:42,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 310 SyntacticMatches, 23 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7250 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3975, Invalid=17487, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:55:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 20:55:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2019-09-03 20:55:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 20:55:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-09-03 20:55:42,343 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 191 [2019-09-03 20:55:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:42,344 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-09-03 20:55:42,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:55:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-09-03 20:55:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 20:55:42,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:42,345 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:42,345 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash 390550737, now seen corresponding path program 45 times [2019-09-03 20:55:42,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:42,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:42,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 805 proven. 346 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:55:45,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:45,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:45,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:45,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:45,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:45,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:45,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:45,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:45,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:45,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 20:55:45,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 111 proven. 1106 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-03 20:55:47,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:47,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:48,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:49,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 111 proven. 1106 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-03 20:55:52,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:52,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 133 [2019-09-03 20:55:52,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:52,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:55:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:55:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=15131, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:55:52,204 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 82 states. [2019-09-03 20:55:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:57,534 INFO L93 Difference]: Finished difference Result 378 states and 383 transitions. [2019-09-03 20:55:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:55:57,534 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 198 [2019-09-03 20:55:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:57,536 INFO L225 Difference]: With dead ends: 378 [2019-09-03 20:55:57,536 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:55:57,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6284 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3263, Invalid=22177, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:55:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:55:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2019-09-03 20:55:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 20:55:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-03 20:55:57,545 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 198 [2019-09-03 20:55:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:57,545 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-03 20:55:57,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:55:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-03 20:55:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 20:55:57,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:57,547 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:57,547 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1246405864, now seen corresponding path program 46 times [2019-09-03 20:55:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:57,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 346 proven. 830 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:55:58,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:58,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:58,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:58,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:58,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:58,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:58,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:55:58,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:59,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 46 proven. 1130 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:55:59,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 46 proven. 1130 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:56:01,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:01,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-09-03 20:56:01,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:01,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:56:01,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:56:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=9160, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:56:01,330 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 80 states. [2019-09-03 20:56:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:04,448 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2019-09-03 20:56:04,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:56:04,449 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 199 [2019-09-03 20:56:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:04,450 INFO L225 Difference]: With dead ends: 213 [2019-09-03 20:56:04,451 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 20:56:04,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 323 SyntacticMatches, 24 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7877 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4303, Invalid=18953, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:56:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 20:56:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-03 20:56:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 20:56:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-09-03 20:56:04,457 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 199 [2019-09-03 20:56:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:04,457 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-09-03 20:56:04,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:56:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-09-03 20:56:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 20:56:04,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:04,459 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:04,459 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2053211503, now seen corresponding path program 47 times [2019-09-03 20:56:04,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:04,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:04,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 876 proven. 373 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:56:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:07,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:07,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:07,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:07,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:07,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:07,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-03 20:56:07,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 20:56:07,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:10,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:10,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:10,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:10,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 116 proven. 1202 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-03 20:56:11,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:56:11,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:12,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 116 proven. 1202 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-03 20:56:16,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:16,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58, 58] total 162 [2019-09-03 20:56:16,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:16,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 20:56:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 20:56:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=22774, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:56:16,764 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 109 states. [2019-09-03 20:56:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:22,924 INFO L93 Difference]: Finished difference Result 393 states and 398 transitions. [2019-09-03 20:56:22,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:56:22,925 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 206 [2019-09-03 20:56:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:22,927 INFO L225 Difference]: With dead ends: 393 [2019-09-03 20:56:22,927 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 20:56:22,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10984 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4228, Invalid=31682, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 20:56:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 20:56:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-09-03 20:56:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 20:56:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-03 20:56:22,934 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 206 [2019-09-03 20:56:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:22,934 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-03 20:56:22,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 20:56:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-03 20:56:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 20:56:22,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:22,936 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:22,936 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2073799498, now seen corresponding path program 48 times [2019-09-03 20:56:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:22,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:22,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 373 proven. 902 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:56:23,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:23,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:23,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:23,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:23,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:23,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:23,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:24,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:24,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:24,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:56:24,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 47 proven. 1297 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-03 20:56:25,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:25,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:25,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 47 proven. 1297 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-03 20:56:27,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 57, 57] total 112 [2019-09-03 20:56:27,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:27,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:56:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:56:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1905, Invalid=10527, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:56:27,213 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 84 states. [2019-09-03 20:56:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:30,777 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2019-09-03 20:56:30,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:56:30,778 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 207 [2019-09-03 20:56:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:30,780 INFO L225 Difference]: With dead ends: 221 [2019-09-03 20:56:30,780 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 20:56:30,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 332 SyntacticMatches, 26 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9090 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4718, Invalid=22014, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:56:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 20:56:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2019-09-03 20:56:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 20:56:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-09-03 20:56:30,787 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 207 [2019-09-03 20:56:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:30,787 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-09-03 20:56:30,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:56:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-09-03 20:56:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 20:56:30,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:30,789 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:30,789 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1919803887, now seen corresponding path program 49 times [2019-09-03 20:56:30,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:30,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:30,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 950 proven. 401 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:56:33,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:33,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:33,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:33,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:33,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:33,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:33,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:33,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:33,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 20:56:33,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 49 proven. 1374 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-03 20:56:36,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:36,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:37,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:56:38,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:38,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 49 proven. 1374 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-03 20:56:41,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60, 60] total 143 [2019-09-03 20:56:41,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:56:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:56:41,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2830, Invalid=17476, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:56:41,749 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 88 states. [2019-09-03 20:56:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:47,095 INFO L93 Difference]: Finished difference Result 408 states and 413 transitions. [2019-09-03 20:56:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:56:47,095 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 214 [2019-09-03 20:56:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:47,097 INFO L225 Difference]: With dead ends: 408 [2019-09-03 20:56:47,097 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 20:56:47,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 342 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7321 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=3788, Invalid=25624, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:56:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 20:56:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2019-09-03 20:56:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-03 20:56:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2019-09-03 20:56:47,103 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 214 [2019-09-03 20:56:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:47,103 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2019-09-03 20:56:47,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:56:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2019-09-03 20:56:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-03 20:56:47,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:47,105 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:47,105 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -363809192, now seen corresponding path program 50 times [2019-09-03 20:56:47,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 401 proven. 977 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:56:48,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:48,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:48,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:48,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:48,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:48,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:48,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:48,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:48,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:56:48,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:48,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 20:56:48,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 50 proven. 1328 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:56:49,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 50 proven. 1328 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:56:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-09-03 20:56:51,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:51,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:56:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:56:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2035, Invalid=10621, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:56:51,599 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 86 states. [2019-09-03 20:56:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:55,267 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2019-09-03 20:56:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:56:55,268 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 215 [2019-09-03 20:56:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:55,269 INFO L225 Difference]: With dead ends: 229 [2019-09-03 20:56:55,270 INFO L226 Difference]: Without dead ends: 229 [2019-09-03 20:56:55,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 349 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9209 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4998, Invalid=22062, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:56:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-03 20:56:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-09-03 20:56:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 20:56:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-09-03 20:56:55,275 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 215 [2019-09-03 20:56:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:55,276 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-09-03 20:56:55,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:56:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-09-03 20:56:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 20:56:55,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:55,278 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:55,278 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -190512593, now seen corresponding path program 51 times [2019-09-03 20:56:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:55,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:55,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 1027 proven. 430 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:56:58,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:58,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:58,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:58,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:58,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:58,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:58,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:58,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:58,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:58,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-03 20:56:58,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:00,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:00,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 126 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 20:57:00,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:01,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 126 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 20:57:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 62, 62] total 148 [2019-09-03 20:57:06,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:57:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:57:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3007, Invalid=18749, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:57:06,832 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 91 states. [2019-09-03 20:57:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:13,351 INFO L93 Difference]: Finished difference Result 423 states and 428 transitions. [2019-09-03 20:57:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:57:13,351 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 222 [2019-09-03 20:57:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:13,353 INFO L225 Difference]: With dead ends: 423 [2019-09-03 20:57:13,353 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 20:57:13,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 355 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=4028, Invalid=27478, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 20:57:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 20:57:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2019-09-03 20:57:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 20:57:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2019-09-03 20:57:13,359 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2019-09-03 20:57:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:13,359 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2019-09-03 20:57:13,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:57:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2019-09-03 20:57:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-03 20:57:13,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:13,361 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:13,361 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1950770038, now seen corresponding path program 52 times [2019-09-03 20:57:13,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 430 proven. 1055 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:57:14,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:14,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:14,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:14,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:14,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:14,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:57:14,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 52 proven. 1433 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:57:16,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 52 proven. 1433 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:57:18,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:18,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-09-03 20:57:18,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:18,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:57:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:57:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2180, Invalid=11392, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:57:18,141 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 89 states. [2019-09-03 20:57:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:22,213 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2019-09-03 20:57:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:57:22,213 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 223 [2019-09-03 20:57:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:22,215 INFO L225 Difference]: With dead ends: 237 [2019-09-03 20:57:22,215 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 20:57:22,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 362 SyntacticMatches, 27 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9914 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5365, Invalid=23705, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:57:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 20:57:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-09-03 20:57:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 20:57:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-09-03 20:57:22,221 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 223 [2019-09-03 20:57:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:22,222 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-09-03 20:57:22,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:57:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-09-03 20:57:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 20:57:22,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:22,223 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:22,223 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1798965423, now seen corresponding path program 53 times [2019-09-03 20:57:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:22,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 1107 proven. 460 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:57:25,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:25,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:25,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:25,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:25,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:25,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:25,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:25,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:25,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 20:57:25,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:25,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 20:57:25,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:30,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 131 proven. 1514 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-03 20:57:30,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:30,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 131 proven. 1514 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-03 20:57:37,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:37,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 64, 64] total 180 [2019-09-03 20:57:37,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:37,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 20:57:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 20:57:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4079, Invalid=28141, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 20:57:37,281 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 121 states. [2019-09-03 20:57:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:43,845 INFO L93 Difference]: Finished difference Result 438 states and 443 transitions. [2019-09-03 20:57:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:57:43,846 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 230 [2019-09-03 20:57:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:43,848 INFO L225 Difference]: With dead ends: 438 [2019-09-03 20:57:43,848 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 20:57:43,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 340 SyntacticMatches, 4 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13603 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=5191, Invalid=39119, Unknown=0, NotChecked=0, Total=44310 [2019-09-03 20:57:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 20:57:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2019-09-03 20:57:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-03 20:57:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2019-09-03 20:57:43,854 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 230 [2019-09-03 20:57:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:43,854 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2019-09-03 20:57:43,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 20:57:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2019-09-03 20:57:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-03 20:57:43,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:43,856 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:43,857 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:43,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash -261021288, now seen corresponding path program 54 times [2019-09-03 20:57:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:43,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:43,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 460 proven. 1136 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:57:45,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:45,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:45,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:45,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:45,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:45,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:45,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:45,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:45,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:45,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:57:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 53 proven. 1621 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-03 20:57:46,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:47,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 53 proven. 1621 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-03 20:57:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 63, 63] total 124 [2019-09-03 20:57:49,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:49,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:57:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:57:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2340, Invalid=12912, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:57:49,163 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 93 states. [2019-09-03 20:57:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:53,675 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-09-03 20:57:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 20:57:53,676 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 231 [2019-09-03 20:57:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:53,677 INFO L225 Difference]: With dead ends: 245 [2019-09-03 20:57:53,678 INFO L226 Difference]: Without dead ends: 245 [2019-09-03 20:57:53,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 371 SyntacticMatches, 29 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11271 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5825, Invalid=27117, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 20:57:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-03 20:57:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2019-09-03 20:57:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-03 20:57:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2019-09-03 20:57:53,690 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 231 [2019-09-03 20:57:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:53,690 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2019-09-03 20:57:53,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:57:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2019-09-03 20:57:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 20:57:53,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:53,692 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:53,692 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -527339793, now seen corresponding path program 55 times [2019-09-03 20:57:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:53,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:53,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 1190 proven. 491 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:57:57,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:57,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:57,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:57,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:57,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:57,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:57,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:57,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:57,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 20:57:57,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:59,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 55 proven. 1707 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-09-03 20:58:00,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:00,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:02,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:03,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 55 proven. 1707 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-09-03 20:58:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 158 [2019-09-03 20:58:06,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:58:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:58:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3457, Invalid=21349, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:58:06,871 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 97 states. [2019-09-03 20:58:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:13,109 INFO L93 Difference]: Finished difference Result 453 states and 458 transitions. [2019-09-03 20:58:13,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:58:13,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 238 [2019-09-03 20:58:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:13,111 INFO L225 Difference]: With dead ends: 453 [2019-09-03 20:58:13,111 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 20:58:13,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8947 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=4610, Invalid=31300, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 20:58:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 20:58:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2019-09-03 20:58:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-03 20:58:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-09-03 20:58:13,117 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 238 [2019-09-03 20:58:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:13,118 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-09-03 20:58:13,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:58:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-09-03 20:58:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-03 20:58:13,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:13,119 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:13,120 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1167236554, now seen corresponding path program 56 times [2019-09-03 20:58:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:13,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 491 proven. 1220 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:58:14,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:14,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:14,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:14,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:14,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:14,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:14,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:14,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:14,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 20:58:14,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:14,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:58:14,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:16,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 56 proven. 1655 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:58:16,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 56 proven. 1655 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:58:18,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:18,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-09-03 20:58:18,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:18,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:58:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:58:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=13015, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:58:18,418 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 95 states. [2019-09-03 20:58:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:22,363 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2019-09-03 20:58:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:58:22,364 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 239 [2019-09-03 20:58:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:22,366 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:58:22,366 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 20:58:22,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 388 SyntacticMatches, 29 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11402 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6138, Invalid=27168, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 20:58:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 20:58:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-09-03 20:58:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 20:58:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2019-09-03 20:58:22,373 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 239 [2019-09-03 20:58:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:22,373 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2019-09-03 20:58:22,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:58:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2019-09-03 20:58:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-03 20:58:22,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:22,375 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:22,375 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1958289263, now seen corresponding path program 57 times [2019-09-03 20:58:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 1276 proven. 523 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:58:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:26,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:26,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:26,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:26,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:26,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:26,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:26,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:26,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:26,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 20:58:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:28,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 141 proven. 1742 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-03 20:58:29,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:29,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:58:29,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:30,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 141 proven. 1742 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-03 20:58:36,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:36,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 68, 68] total 163 [2019-09-03 20:58:36,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:36,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:58:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:58:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3652, Invalid=22754, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:58:36,455 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 100 states. [2019-09-03 20:58:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:43,342 INFO L93 Difference]: Finished difference Result 468 states and 473 transitions. [2019-09-03 20:58:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:58:43,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 246 [2019-09-03 20:58:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:43,344 INFO L225 Difference]: With dead ends: 468 [2019-09-03 20:58:43,345 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 20:58:43,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 394 SyntacticMatches, 3 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9470 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=4874, Invalid=33346, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 20:58:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 20:58:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2019-09-03 20:58:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-03 20:58:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-09-03 20:58:43,351 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 246 [2019-09-03 20:58:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:43,351 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2019-09-03 20:58:43,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:58:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2019-09-03 20:58:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-03 20:58:43,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:43,354 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:43,354 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:43,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1853529304, now seen corresponding path program 58 times [2019-09-03 20:58:43,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:43,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:43,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 523 proven. 1307 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:58:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:44,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:44,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:44,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:44,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:44,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 20:58:44,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 58 proven. 1772 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:58:46,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 58 proven. 1772 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:58:48,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-09-03 20:58:48,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:48,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:58:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:58:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2645, Invalid=13867, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:58:48,913 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 98 states. [2019-09-03 20:58:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:52,905 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2019-09-03 20:58:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:58:52,906 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 247 [2019-09-03 20:58:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:52,908 INFO L225 Difference]: With dead ends: 261 [2019-09-03 20:58:52,908 INFO L226 Difference]: Without dead ends: 261 [2019-09-03 20:58:52,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 401 SyntacticMatches, 30 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12185 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6544, Invalid=28988, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 20:58:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-03 20:58:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2019-09-03 20:58:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-03 20:58:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2019-09-03 20:58:52,914 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 247 [2019-09-03 20:58:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:52,914 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2019-09-03 20:58:52,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:58:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2019-09-03 20:58:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-03 20:58:52,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:52,916 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:52,916 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1598213039, now seen corresponding path program 59 times [2019-09-03 20:58:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:52,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 1365 proven. 556 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:58:56,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:56,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:56,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:56,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:56,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:56,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:56,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:56,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-09-03 20:58:56,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:56,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 20:58:56,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:02,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:02,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:02,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:02,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 59 proven. 1949 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-03 20:59:02,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:02,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:06,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 59 proven. 1949 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-03 20:59:10,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:10,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 198 [2019-09-03 20:59:10,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:10,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 20:59:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 20:59:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=34046, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 20:59:10,766 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 133 states. [2019-09-03 20:59:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:19,924 INFO L93 Difference]: Finished difference Result 483 states and 488 transitions. [2019-09-03 20:59:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:59:19,924 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 254 [2019-09-03 20:59:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:19,927 INFO L225 Difference]: With dead ends: 483 [2019-09-03 20:59:19,927 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 20:59:19,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 376 SyntacticMatches, 4 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16558 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=6282, Invalid=47310, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 20:59:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 20:59:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2019-09-03 20:59:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-03 20:59:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2019-09-03 20:59:19,940 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 254 [2019-09-03 20:59:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:19,940 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2019-09-03 20:59:19,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 20:59:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2019-09-03 20:59:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 20:59:19,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:19,943 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:19,944 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1074441994, now seen corresponding path program 60 times [2019-09-03 20:59:19,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 556 proven. 1397 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:59:21,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:21,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:21,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:21,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:21,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:21,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:21,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:21,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:21,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:21,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 20:59:21,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 59 proven. 1981 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-03 20:59:23,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:24,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:24,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:24,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 59 proven. 1981 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-03 20:59:26,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 69, 69] total 136 [2019-09-03 20:59:26,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:26,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:59:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:59:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2820, Invalid=15540, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:59:26,104 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 102 states. [2019-09-03 20:59:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:30,648 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2019-09-03 20:59:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:59:30,649 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 255 [2019-09-03 20:59:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:30,651 INFO L225 Difference]: With dead ends: 269 [2019-09-03 20:59:30,651 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 20:59:30,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 410 SyntacticMatches, 32 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13686 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7049, Invalid=32751, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 20:59:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 20:59:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2019-09-03 20:59:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 20:59:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2019-09-03 20:59:30,658 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 255 [2019-09-03 20:59:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:30,658 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2019-09-03 20:59:30,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:59:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2019-09-03 20:59:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 20:59:30,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:30,660 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:30,661 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash -797386287, now seen corresponding path program 61 times [2019-09-03 20:59:30,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:30,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 1457 proven. 590 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:59:34,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:34,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:34,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:34,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:34,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:34,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:34,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:35,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 20:59:35,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:37,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:37,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:37,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 61 proven. 2076 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-09-03 20:59:38,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:38,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:39,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:40,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:41,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 61 proven. 2076 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-09-03 20:59:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:46,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 72, 72] total 173 [2019-09-03 20:59:46,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:46,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 20:59:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 20:59:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4147, Invalid=25609, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:59:46,209 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 106 states. [2019-09-03 20:59:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:54,229 INFO L93 Difference]: Finished difference Result 498 states and 503 transitions. [2019-09-03 20:59:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:59:54,229 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 262 [2019-09-03 20:59:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:54,231 INFO L225 Difference]: With dead ends: 498 [2019-09-03 20:59:54,231 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 20:59:54,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 420 SyntacticMatches, 3 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10735 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=5513, Invalid=37543, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 20:59:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 20:59:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2019-09-03 20:59:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 20:59:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2019-09-03 20:59:54,238 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 262 [2019-09-03 20:59:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:54,238 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2019-09-03 20:59:54,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 20:59:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2019-09-03 20:59:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-03 20:59:54,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:54,240 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:54,240 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash 198256664, now seen corresponding path program 62 times [2019-09-03 20:59:54,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 590 proven. 1490 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:59:55,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:55,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:55,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:55,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:55,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:55,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:55,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:55,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:55,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:59:55,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:55,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 20:59:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:57,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 62 proven. 2018 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:59:57,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 62 proven. 2018 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 21:00:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:00,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-09-03 21:00:00,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:00,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 21:00:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 21:00:00,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2980, Invalid=15652, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 21:00:00,481 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 104 states. [2019-09-03 21:00:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:05,305 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-09-03 21:00:05,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:00:05,305 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 263 [2019-09-03 21:00:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:05,308 INFO L225 Difference]: With dead ends: 277 [2019-09-03 21:00:05,308 INFO L226 Difference]: Without dead ends: 277 [2019-09-03 21:00:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 427 SyntacticMatches, 32 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13829 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=7395, Invalid=32805, Unknown=0, NotChecked=0, Total=40200 [2019-09-03 21:00:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-03 21:00:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-09-03 21:00:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 21:00:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2019-09-03 21:00:05,316 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 263 [2019-09-03 21:00:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:05,316 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2019-09-03 21:00:05,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 21:00:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2019-09-03 21:00:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 21:00:05,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:05,318 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:05,318 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1893013615, now seen corresponding path program 63 times [2019-09-03 21:00:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:05,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:05,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 1552 proven. 625 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 21:00:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:09,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:09,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:09,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:09,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:09,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:09,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:09,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:09,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:09,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 21:00:09,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:12,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:12,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:12,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 156 proven. 2114 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-03 21:00:13,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:15,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:16,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:17,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:17,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 156 proven. 2114 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-03 21:00:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:21,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 178 [2019-09-03 21:00:21,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:21,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 21:00:21,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 21:00:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4360, Invalid=27146, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:00:21,707 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 109 states. [2019-09-03 21:00:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:31,096 INFO L93 Difference]: Finished difference Result 513 states and 518 transitions. [2019-09-03 21:00:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 21:00:31,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 270 [2019-09-03 21:00:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:31,098 INFO L225 Difference]: With dead ends: 513 [2019-09-03 21:00:31,099 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 21:00:31,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 433 SyntacticMatches, 3 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=5801, Invalid=39781, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 21:00:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 21:00:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2019-09-03 21:00:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-03 21:00:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-09-03 21:00:31,105 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 270 [2019-09-03 21:00:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:31,105 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-09-03 21:00:31,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 21:00:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-09-03 21:00:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-03 21:00:31,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:31,107 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:31,107 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -856019018, now seen corresponding path program 64 times [2019-09-03 21:00:31,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:31,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 625 proven. 1586 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 21:00:32,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:32,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:32,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:32,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:32,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:32,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:32,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:32,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 21:00:32,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:34,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 64 proven. 2147 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 21:00:34,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 64 proven. 2147 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 21:00:37,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-09-03 21:00:37,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:37,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 21:00:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 21:00:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3155, Invalid=16585, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 21:00:37,673 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 107 states. [2019-09-03 21:00:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:42,306 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2019-09-03 21:00:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 21:00:42,307 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 271 [2019-09-03 21:00:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:42,309 INFO L225 Difference]: With dead ends: 285 [2019-09-03 21:00:42,309 INFO L226 Difference]: Without dead ends: 285 [2019-09-03 21:00:42,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 440 SyntacticMatches, 33 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14690 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7840, Invalid=34802, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 21:00:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-03 21:00:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-09-03 21:00:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 21:00:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2019-09-03 21:00:42,316 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 271 [2019-09-03 21:00:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:42,316 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2019-09-03 21:00:42,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 21:00:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2019-09-03 21:00:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-03 21:00:42,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:42,318 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:42,319 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash 79684369, now seen corresponding path program 65 times [2019-09-03 21:00:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:42,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 1650 proven. 661 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 21:00:47,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:47,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:47,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:47,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:47,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:47,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:47,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:47,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:47,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 21:00:47,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:47,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-03 21:00:47,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:53,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:53,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 161 proven. 2246 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-03 21:00:53,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:54,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:00:54,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:54,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:56,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 161 proven. 2246 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-03 21:01:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 76, 76] total 216 [2019-09-03 21:01:03,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 21:01:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 21:01:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5864, Invalid=40576, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:01:03,397 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 145 states. [2019-09-03 21:01:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:16,757 INFO L93 Difference]: Finished difference Result 528 states and 533 transitions. [2019-09-03 21:01:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:01:16,758 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 278 [2019-09-03 21:01:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:16,760 INFO L225 Difference]: With dead ends: 528 [2019-09-03 21:01:16,760 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 21:01:16,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19678 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=7414, Invalid=56342, Unknown=0, NotChecked=0, Total=63756 [2019-09-03 21:01:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 21:01:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2019-09-03 21:01:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-03 21:01:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2019-09-03 21:01:16,766 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 278 [2019-09-03 21:01:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:16,767 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2019-09-03 21:01:16,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 21:01:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2019-09-03 21:01:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-03 21:01:16,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:16,769 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:16,769 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1327971496, now seen corresponding path program 66 times [2019-09-03 21:01:16,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:16,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:16,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 661 proven. 1685 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 21:01:18,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:18,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:18,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:18,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:18,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:18,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:18,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:18,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:18,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:18,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:01:18,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 65 proven. 2377 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-03 21:01:20,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 65 proven. 2377 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-03 21:01:24,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:24,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75, 75] total 148 [2019-09-03 21:01:24,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:24,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 21:01:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 21:01:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3345, Invalid=18411, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 21:01:24,018 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 111 states. [2019-09-03 21:01:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:30,052 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2019-09-03 21:01:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 21:01:30,052 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 279 [2019-09-03 21:01:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:30,054 INFO L225 Difference]: With dead ends: 293 [2019-09-03 21:01:30,054 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 21:01:30,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 449 SyntacticMatches, 35 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16335 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=8390, Invalid=38916, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:01:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 21:01:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2019-09-03 21:01:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-03 21:01:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2019-09-03 21:01:30,060 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 279 [2019-09-03 21:01:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:30,061 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2019-09-03 21:01:30,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 21:01:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2019-09-03 21:01:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 21:01:30,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:30,062 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:30,062 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1268493009, now seen corresponding path program 67 times [2019-09-03 21:01:30,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:30,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:30,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:30,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:30,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 1751 proven. 698 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 21:01:34,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:34,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:34,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:34,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:34,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:34,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:34,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:34,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:35,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 21:01:35,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:38,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:38,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:38,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:38,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 67 proven. 2481 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-09-03 21:01:38,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:38,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 67 proven. 2481 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-09-03 21:01:48,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:48,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 188 [2019-09-03 21:01:48,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:48,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 21:01:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 21:01:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4900, Invalid=30256, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:01:48,059 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 115 states. [2019-09-03 21:01:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:57,725 INFO L93 Difference]: Finished difference Result 543 states and 548 transitions. [2019-09-03 21:01:57,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 21:01:57,726 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 286 [2019-09-03 21:01:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:57,728 INFO L225 Difference]: With dead ends: 543 [2019-09-03 21:01:57,728 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 21:01:57,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 459 SyntacticMatches, 3 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12685 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=6497, Invalid=44353, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 21:01:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 21:01:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2019-09-03 21:01:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-03 21:01:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2019-09-03 21:01:57,735 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 286 [2019-09-03 21:01:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2019-09-03 21:01:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 21:01:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2019-09-03 21:01:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-03 21:01:57,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:57,736 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:57,736 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -929563018, now seen corresponding path program 68 times [2019-09-03 21:01:57,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:57,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:57,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 698 proven. 1787 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 21:01:59,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:59,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:59,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:59,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:59,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:59,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:59,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:59,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 21:01:59,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:59,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:01:59,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:01,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 68 proven. 2417 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 21:02:01,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 68 proven. 2417 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 21:02:05,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:05,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-09-03 21:02:05,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:05,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 21:02:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 21:02:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3520, Invalid=18532, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 21:02:05,023 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 113 states. [2019-09-03 21:02:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:10,873 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2019-09-03 21:02:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 21:02:10,874 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 287 [2019-09-03 21:02:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:10,876 INFO L225 Difference]: With dead ends: 301 [2019-09-03 21:02:10,876 INFO L226 Difference]: Without dead ends: 301 [2019-09-03 21:02:10,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 466 SyntacticMatches, 35 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16490 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=8769, Invalid=38973, Unknown=0, NotChecked=0, Total=47742 [2019-09-03 21:02:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-03 21:02:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2019-09-03 21:02:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 21:02:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2019-09-03 21:02:10,883 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 287 [2019-09-03 21:02:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:10,883 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2019-09-03 21:02:10,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 21:02:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2019-09-03 21:02:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 21:02:10,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:10,885 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:10,886 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1233124433, now seen corresponding path program 69 times [2019-09-03 21:02:10,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:10,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:10,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:10,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:10,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 1855 proven. 736 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 21:02:16,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:16,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:16,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:16,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:16,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:16,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:16,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:16,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-03 21:02:16,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:19,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:19,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:19,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:19,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 171 proven. 2522 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-03 21:02:20,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:24,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:24,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:24,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:24,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:24,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 171 proven. 2522 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-03 21:02:29,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:29,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 80, 80] total 193 [2019-09-03 21:02:29,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:29,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 21:02:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 21:02:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5131, Invalid=31925, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 21:02:29,865 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 118 states. [2019-09-03 21:02:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:40,704 INFO L93 Difference]: Finished difference Result 558 states and 563 transitions. [2019-09-03 21:02:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:02:40,704 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 294 [2019-09-03 21:02:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:40,707 INFO L225 Difference]: With dead ends: 558 [2019-09-03 21:02:40,707 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 21:02:40,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 472 SyntacticMatches, 3 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13304 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=6809, Invalid=46783, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 21:02:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 21:02:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2019-09-03 21:02:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 21:02:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2019-09-03 21:02:40,715 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 294 [2019-09-03 21:02:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:40,715 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2019-09-03 21:02:40,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 21:02:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2019-09-03 21:02:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-03 21:02:40,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:40,717 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:40,717 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -956993896, now seen corresponding path program 70 times [2019-09-03 21:02:40,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 736 proven. 1892 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 21:02:42,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:42,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:42,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:42,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:42,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:42,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 21:02:42,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 70 proven. 2558 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 21:02:45,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 70 proven. 2558 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 21:02:48,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-09-03 21:02:48,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:48,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 21:02:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 21:02:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3710, Invalid=19546, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 21:02:48,341 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 116 states. [2019-09-03 21:02:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:54,633 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2019-09-03 21:02:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:02:54,633 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 295 [2019-09-03 21:02:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:54,635 INFO L225 Difference]: With dead ends: 309 [2019-09-03 21:02:54,636 INFO L226 Difference]: Without dead ends: 309 [2019-09-03 21:02:54,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 479 SyntacticMatches, 36 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17429 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=9253, Invalid=41147, Unknown=0, NotChecked=0, Total=50400 [2019-09-03 21:02:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-03 21:02:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2019-09-03 21:02:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-03 21:02:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2019-09-03 21:02:54,642 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 295 [2019-09-03 21:02:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:54,643 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2019-09-03 21:02:54,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 21:02:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2019-09-03 21:02:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-03 21:02:54,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:54,644 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:54,644 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash 671908335, now seen corresponding path program 71 times [2019-09-03 21:02:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 1962 proven. 775 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 21:02:59,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:59,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:59,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:59,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:59,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:59,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:59,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:00,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-09-03 21:03:00,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:00,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-03 21:03:00,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 71 proven. 2771 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-03 21:03:07,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:07,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:09,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:10,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:11,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:12,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:13,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:03:13,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:13,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 71 proven. 2771 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-03 21:03:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 234 [2019-09-03 21:03:18,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:18,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 21:03:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 21:03:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=47609, Unknown=0, NotChecked=0, Total=54522 [2019-09-03 21:03:18,842 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 157 states. [2019-09-03 21:03:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:30,829 INFO L93 Difference]: Finished difference Result 573 states and 578 transitions. [2019-09-03 21:03:30,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 21:03:30,829 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 302 [2019-09-03 21:03:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:30,831 INFO L225 Difference]: With dead ends: 573 [2019-09-03 21:03:30,831 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 21:03:30,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 448 SyntacticMatches, 4 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23203 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=8709, Invalid=66093, Unknown=0, NotChecked=0, Total=74802 [2019-09-03 21:03:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 21:03:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 306. [2019-09-03 21:03:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 21:03:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2019-09-03 21:03:30,838 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 302 [2019-09-03 21:03:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:30,838 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2019-09-03 21:03:30,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 21:03:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2019-09-03 21:03:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-03 21:03:30,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:30,840 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:30,840 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash -118833866, now seen corresponding path program 72 times [2019-09-03 21:03:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:30,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:30,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 775 proven. 2000 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 21:03:32,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:32,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:32,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:32,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:32,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:32,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:32,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:32,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:32,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-03 21:03:32,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 71 proven. 2809 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-03 21:03:35,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:36,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:36,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:36,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 71 proven. 2809 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-03 21:03:39,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:39,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 81, 81] total 160 [2019-09-03 21:03:39,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:39,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 21:03:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 21:03:39,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3915, Invalid=21525, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 21:03:39,155 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 120 states. [2019-09-03 21:03:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:45,263 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2019-09-03 21:03:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 21:03:45,263 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 303 [2019-09-03 21:03:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:45,265 INFO L225 Difference]: With dead ends: 317 [2019-09-03 21:03:45,265 INFO L226 Difference]: Without dead ends: 317 [2019-09-03 21:03:45,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 488 SyntacticMatches, 38 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19218 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=9848, Invalid=45612, Unknown=0, NotChecked=0, Total=55460 [2019-09-03 21:03:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-03 21:03:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2019-09-03 21:03:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 21:03:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2019-09-03 21:03:45,273 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 303 [2019-09-03 21:03:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:45,274 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2019-09-03 21:03:45,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 21:03:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2019-09-03 21:03:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 21:03:45,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:45,276 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:45,276 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2128796271, now seen corresponding path program 73 times [2019-09-03 21:03:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:45,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:45,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 2072 proven. 815 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 21:03:50,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:50,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:50,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:50,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:50,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:50,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:50,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:50,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:50,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-03 21:03:51,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:54,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:54,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:54,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 73 proven. 2922 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-09-03 21:03:55,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:55,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:55,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:56,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:57,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:58,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:04:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:04:00,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:00,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:00,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 73 proven. 2922 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-09-03 21:04:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:06,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 84, 84] total 203 [2019-09-03 21:04:06,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:06,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 21:04:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 21:04:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5716, Invalid=35290, Unknown=0, NotChecked=0, Total=41006 [2019-09-03 21:04:06,225 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 124 states. [2019-09-03 21:04:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:18,419 INFO L93 Difference]: Finished difference Result 588 states and 593 transitions. [2019-09-03 21:04:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 21:04:18,419 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 310 [2019-09-03 21:04:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:18,422 INFO L225 Difference]: With dead ends: 588 [2019-09-03 21:04:18,422 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 21:04:18,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 498 SyntacticMatches, 3 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14797 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=7562, Invalid=51730, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 21:04:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 21:04:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2019-09-03 21:04:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-03 21:04:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2019-09-03 21:04:18,429 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 310 [2019-09-03 21:04:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:18,430 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2019-09-03 21:04:18,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 21:04:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2019-09-03 21:04:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-03 21:04:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:18,431 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:18,431 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2022386136, now seen corresponding path program 74 times [2019-09-03 21:04:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:18,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:18,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 815 proven. 2111 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 21:04:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:20,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:20,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:20,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:20,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:20,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:20,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 21:04:20,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:20,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 21:04:20,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 74 proven. 2852 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 21:04:23,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 74 proven. 2852 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 21:04:26,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:26,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-09-03 21:04:26,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:26,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-03 21:04:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-03 21:04:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=21655, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 21:04:26,802 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 122 states. [2019-09-03 21:04:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,046 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2019-09-03 21:04:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:04:34,047 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 311 [2019-09-03 21:04:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,049 INFO L225 Difference]: With dead ends: 325 [2019-09-03 21:04:34,049 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 21:04:34,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 505 SyntacticMatches, 38 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19385 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=10260, Invalid=45672, Unknown=0, NotChecked=0, Total=55932 [2019-09-03 21:04:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 21:04:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-09-03 21:04:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-03 21:04:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2019-09-03 21:04:34,057 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 311 [2019-09-03 21:04:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,057 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2019-09-03 21:04:34,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-03 21:04:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2019-09-03 21:04:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 21:04:34,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,059 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,059 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash -387342673, now seen corresponding path program 75 times [2019-09-03 21:04:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 2185 proven. 856 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 21:04:39,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:39,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:39,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:39,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:39,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:39,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:39,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:39,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-03 21:04:39,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:44,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms