java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:47:18,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:47:18,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:47:18,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:47:18,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:47:18,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:47:18,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:47:18,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:47:18,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:47:18,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:47:18,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:47:18,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:47:18,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:47:18,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:47:18,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:47:18,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:47:18,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:47:18,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:47:18,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:47:18,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:47:18,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:47:18,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:47:18,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:47:18,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:47:18,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:47:18,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:47:18,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:47:18,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:47:18,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:47:18,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:47:18,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:47:18,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:47:18,147 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:47:18,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:47:18,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:47:18,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:47:18,151 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:47:18,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:47:18,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:47:18,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:47:18,179 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:47:18,179 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:47:18,179 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:47:18,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:47:18,180 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:47:18,180 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:47:18,180 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:47:18,180 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:47:18,181 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:47:18,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:47:18,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:47:18,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:47:18,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:47:18,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:47:18,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:47:18,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:47:18,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:47:18,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:47:18,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:47:18,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:47:18,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:47:18,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:47:18,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:47:18,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:47:18,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:47:18,184 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:47:18,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:47:18,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:47:18,185 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:47:18,185 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:47:18,185 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:47:18,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:47:18,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:47:18,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:47:18,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:47:18,268 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:47:18,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i [2018-11-07 16:47:18,336 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451467a57/0e986dab7db44bcc9718c609c67aecf6/FLAGd257e8f93 [2018-11-07 16:47:18,737 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:47:18,738 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2_true-unreach-call_true-termination.i [2018-11-07 16:47:18,745 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451467a57/0e986dab7db44bcc9718c609c67aecf6/FLAGd257e8f93 [2018-11-07 16:47:18,760 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451467a57/0e986dab7db44bcc9718c609c67aecf6 [2018-11-07 16:47:18,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:47:18,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:47:18,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:47:18,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:47:18,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:47:18,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:18" (1/1) ... [2018-11-07 16:47:18,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5156a501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:18, skipping insertion in model container [2018-11-07 16:47:18,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:47:18" (1/1) ... [2018-11-07 16:47:18,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:47:18,817 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:47:19,052 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:47:19,057 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:47:19,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:47:19,086 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:47:19,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19 WrapperNode [2018-11-07 16:47:19,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:47:19,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:47:19,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:47:19,088 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:47:19,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:47:19,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:47:19,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:47:19,108 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:47:19,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (1/1) ... [2018-11-07 16:47:19,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:47:19,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:47:19,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:47:19,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:47:19,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (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 [2018-11-07 16:47:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:47:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:47:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:47:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:47:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:47:19,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:47:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:47:19,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:47:19,424 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:47:19,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:19 BoogieIcfgContainer [2018-11-07 16:47:19,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:47:19,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:47:19,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:47:19,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:47:19,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:47:18" (1/3) ... [2018-11-07 16:47:19,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f53bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:19, skipping insertion in model container [2018-11-07 16:47:19,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:47:19" (2/3) ... [2018-11-07 16:47:19,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0f53bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:47:19, skipping insertion in model container [2018-11-07 16:47:19,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:47:19" (3/3) ... [2018-11-07 16:47:19,433 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2_true-unreach-call_true-termination.i [2018-11-07 16:47:19,444 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:47:19,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:47:19,470 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:47:19,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:47:19,503 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:47:19,503 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:47:19,503 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:47:19,503 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:47:19,504 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:47:19,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:47:19,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:47:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 16:47:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:47:19,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:19,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:19,534 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:19,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:19,542 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-11-07 16:47:19,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:19,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:47:19,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:47:19,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:47:19,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:47:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:47:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:47:19,664 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 16:47:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:19,685 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-07 16:47:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:47:19,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:47:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:19,695 INFO L225 Difference]: With dead ends: 32 [2018-11-07 16:47:19,695 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 16:47:19,699 INFO L604 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 [2018-11-07 16:47:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 16:47:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 16:47:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 16:47:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-07 16:47:19,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-07 16:47:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:19,738 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-07 16:47:19,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:47:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-07 16:47:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:47:19,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:19,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:19,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:19,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-11-07 16:47:19,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:19,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:19,743 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:47:19,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:47:19,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:47:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:47:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:47:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:47:19,833 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-07 16:47:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:20,003 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 16:47:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:47:20,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:47:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:20,005 INFO L225 Difference]: With dead ends: 21 [2018-11-07 16:47:20,006 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:47:20,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:47:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:47:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-07 16:47:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 16:47:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-07 16:47:20,013 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-07 16:47:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:20,014 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-07 16:47:20,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:47:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-07 16:47:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:47:20,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:20,016 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:20,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:20,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-11-07 16:47:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:20,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 16:47:20,135 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [15], [22], [25], [27], [33], [34], [35], [37] [2018-11-07 16:47:20,166 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:47:20,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:47:20,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:47:20,330 INFO L272 AbstractInterpreter]: Visited 13 different actions 40 times. Merged at 4 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 16:47:20,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:20,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:47:20,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,360 INFO L194 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:20,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:20,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:20,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:20,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:47:20,543 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:20,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:47:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:47:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:47:20,544 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-11-07 16:47:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:20,619 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-07 16:47:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:47:20,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 16:47:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:20,621 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:47:20,621 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 16:47:20,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:47:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 16:47:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-07 16:47:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:47:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 16:47:20,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-11-07 16:47:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:20,626 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 16:47:20,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:47:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 16:47:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:47:20,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:20,628 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:20,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:20,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash -489337255, now seen corresponding path program 2 times [2018-11-07 16:47:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:20,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:20,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:20,723 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:20,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:20,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:20,724 INFO L194 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:20,744 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:20,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:47:20,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:20,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:20,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:47:20,956 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:20,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:47:20,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:47:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:47:20,958 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-11-07 16:47:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:21,118 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 16:47:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:47:21,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 16:47:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:21,119 INFO L225 Difference]: With dead ends: 27 [2018-11-07 16:47:21,120 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:47:21,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:47:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:47:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 16:47:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 16:47:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-07 16:47:21,125 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-07 16:47:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:21,126 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-07 16:47:21,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:47:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-07 16:47:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:47:21,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:21,127 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:21,127 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:21,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -169763, now seen corresponding path program 3 times [2018-11-07 16:47:21,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:21,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:21,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,240 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:21,240 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:21,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:21,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,240 INFO L194 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 [2018-11-07 16:47:21,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:21,252 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:21,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:21,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:21,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:47:21,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:47:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:47:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:47:21,399 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-11-07 16:47:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:21,441 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-07 16:47:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:47:21,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 16:47:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:21,445 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:47:21,446 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 16:47:21,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:47:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 16:47:21,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 16:47:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:47:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 16:47:21,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-11-07 16:47:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:21,452 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 16:47:21,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:47:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 16:47:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:47:21,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:21,453 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:21,453 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:21,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 4 times [2018-11-07 16:47:21,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:21,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:21,455 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,643 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:21,643 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:21,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:21,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:21,644 INFO L194 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 [2018-11-07 16:47:21,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:21,660 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:21,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:21,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:47:21,836 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:21,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:47:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:47:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:47:21,837 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-11-07 16:47:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:22,010 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 16:47:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:47:22,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 16:47:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:22,012 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:47:22,012 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 16:47:22,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:47:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 16:47:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-07 16:47:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 16:47:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-07 16:47:22,018 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-11-07 16:47:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:22,019 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-07 16:47:22,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:47:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-07 16:47:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:47:22,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:22,020 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:22,021 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:22,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1170618205, now seen corresponding path program 5 times [2018-11-07 16:47:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:22,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:22,342 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:22,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:22,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,343 INFO L194 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 [2018-11-07 16:47:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:22,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:22,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:47:22,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:22,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:22,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:22,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:22,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:47:22,568 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:22,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:47:22,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:47:22,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:47:22,570 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-11-07 16:47:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:22,608 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-07 16:47:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:47:22,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-07 16:47:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:22,610 INFO L225 Difference]: With dead ends: 36 [2018-11-07 16:47:22,610 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 16:47:22,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:47:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 16:47:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-07 16:47:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:47:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 16:47:22,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-07 16:47:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:22,617 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 16:47:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:47:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 16:47:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:47:22,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:22,618 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:22,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:22,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash -520507047, now seen corresponding path program 6 times [2018-11-07 16:47:22,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:22,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:22,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:22,749 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:22,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:22,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:22,750 INFO L194 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 [2018-11-07 16:47:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:22,759 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:22,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:22,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:22,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:22,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:23,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:23,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:47:23,032 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:23,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:47:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:47:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:47:23,033 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-11-07 16:47:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:23,094 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 16:47:23,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:47:23,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 16:47:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:23,100 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:47:23,100 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:47:23,101 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:47:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:47:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 16:47:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:47:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-07 16:47:23,106 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-07 16:47:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:23,107 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-07 16:47:23,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:47:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-07 16:47:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:47:23,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:23,108 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:23,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:23,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash -866507299, now seen corresponding path program 7 times [2018-11-07 16:47:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:23,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:23,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:23,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:23,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:23,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:23,321 INFO L194 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 [2018-11-07 16:47:23,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:23,331 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:23,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:23,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:23,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:23,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:47:23,728 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:23,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:47:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:47:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:47:23,729 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-11-07 16:47:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:23,771 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-07 16:47:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:47:23,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 16:47:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:23,774 INFO L225 Difference]: With dead ends: 42 [2018-11-07 16:47:23,774 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:47:23,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:47:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:47:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 16:47:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:47:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 16:47:23,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 16:47:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:23,780 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 16:47:23,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:47:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 16:47:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:47:23,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:23,781 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:23,781 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:23,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -638504231, now seen corresponding path program 8 times [2018-11-07 16:47:23,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:23,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:23,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:23,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:23,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:23,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:23,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:23,981 INFO L194 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 [2018-11-07 16:47:23,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:23,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:24,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:47:24,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:24,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:24,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:24,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:24,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 16:47:24,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:24,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:47:24,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:47:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:47:24,266 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-11-07 16:47:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:24,419 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 16:47:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:47:24,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-07 16:47:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:24,423 INFO L225 Difference]: With dead ends: 45 [2018-11-07 16:47:24,423 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:47:24,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:47:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:47:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 16:47:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:47:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 16:47:24,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-07 16:47:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:24,430 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 16:47:24,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:47:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 16:47:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 16:47:24,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:24,431 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:24,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:24,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1457599581, now seen corresponding path program 9 times [2018-11-07 16:47:24,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:24,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:24,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:24,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,593 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:24,593 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:24,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:24,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:24,594 INFO L194 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 [2018-11-07 16:47:24,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:24,603 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:24,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:24,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:24,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:24,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:24,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:24,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:47:24,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:24,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:47:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:47:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:47:24,928 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-11-07 16:47:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:24,971 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-07 16:47:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:47:24,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-07 16:47:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:24,973 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:47:24,973 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 16:47:24,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:47:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 16:47:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 16:47:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:47:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 16:47:24,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-07 16:47:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:24,980 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 16:47:24,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:47:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 16:47:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:47:24,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:24,981 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:24,981 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 10 times [2018-11-07 16:47:24,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:24,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:24,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:25,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:25,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:25,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:25,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:25,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:25,122 INFO L194 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 [2018-11-07 16:47:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:25,131 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:25,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:25,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:25,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:25,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:47:25,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:25,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:47:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:47:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:47:25,632 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-11-07 16:47:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:25,685 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 16:47:25,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:47:25,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 16:47:25,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:25,695 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:47:25,695 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:47:25,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:47:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:47:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-07 16:47:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:47:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-07 16:47:25,704 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-07 16:47:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:25,704 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-07 16:47:25,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:47:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-07 16:47:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:47:25,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:25,708 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:25,708 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:25,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1434230051, now seen corresponding path program 11 times [2018-11-07 16:47:25,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:25,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:25,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:25,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:26,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:26,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:26,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,046 INFO L194 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 [2018-11-07 16:47:26,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:26,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:26,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:47:26,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:26,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:26,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:47:26,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:26,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:47:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:47:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:47:26,510 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-11-07 16:47:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:26,606 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 16:47:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:47:26,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 16:47:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:26,607 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:47:26,607 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:47:26,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:47:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:47:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 16:47:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:47:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 16:47:26,614 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-07 16:47:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:26,615 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 16:47:26,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:47:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 16:47:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:47:26,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:26,616 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:26,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -85797415, now seen corresponding path program 12 times [2018-11-07 16:47:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:26,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:26,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:26,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,815 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:26,815 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:26,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:26,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:26,815 INFO L194 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 [2018-11-07 16:47:26,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:26,824 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:26,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:26,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:26,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:26,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:47:27,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:27,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:47:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:47:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:47:27,222 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-11-07 16:47:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:27,267 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 16:47:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:47:27,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-07 16:47:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:27,270 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:47:27,270 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:47:27,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:47:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:47:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 16:47:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 16:47:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 16:47:27,275 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-07 16:47:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:27,276 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 16:47:27,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:47:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 16:47:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:47:27,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:27,277 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:27,277 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:27,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 241742173, now seen corresponding path program 13 times [2018-11-07 16:47:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:27,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:27,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:27,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:27,480 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:27,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:27,480 INFO L194 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 [2018-11-07 16:47:27,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:27,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:27,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:27,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:28,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:47:28,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:28,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:47:28,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:47:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:47:28,038 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-11-07 16:47:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:28,091 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-07 16:47:28,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:47:28,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-07 16:47:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:28,094 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:47:28,095 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 16:47:28,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:47:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 16:47:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 16:47:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:47:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 16:47:28,102 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-07 16:47:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 16:47:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:47:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 16:47:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:47:28,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:28,103 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:28,104 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:28,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash -192088231, now seen corresponding path program 14 times [2018-11-07 16:47:28,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:28,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:28,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:28,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:28,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:28,309 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:28,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:28,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:28,310 INFO L194 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:28,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:28,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:28,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:47:28,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:28,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:28,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:29,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:29,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 16:47:29,206 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:29,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:47:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:47:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:47:29,208 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-11-07 16:47:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:29,295 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 16:47:29,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:47:29,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 16:47:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:29,296 INFO L225 Difference]: With dead ends: 63 [2018-11-07 16:47:29,296 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:47:29,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:47:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:47:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-07 16:47:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 16:47:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-07 16:47:29,303 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-07 16:47:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:29,303 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-07 16:47:29,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:47:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-07 16:47:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 16:47:29,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:29,304 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:29,305 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:29,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash -877060131, now seen corresponding path program 15 times [2018-11-07 16:47:29,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:29,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:29,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:29,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:29,532 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:29,532 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:29,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:29,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:29,532 INFO L194 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:29,540 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:29,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:29,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:29,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:29,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:47:30,380 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:30,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:47:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:47:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:47:30,381 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-11-07 16:47:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:30,435 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 16:47:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:47:30,436 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-07 16:47:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:30,437 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:47:30,437 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:47:30,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:47:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:47:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 16:47:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:47:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 16:47:30,443 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-07 16:47:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:30,444 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 16:47:30,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:47:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 16:47:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:47:30,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:30,445 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:30,445 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:30,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:30,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1485309735, now seen corresponding path program 16 times [2018-11-07 16:47:30,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:30,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:31,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:31,080 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:31,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:31,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:31,080 INFO L194 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 [2018-11-07 16:47:31,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:31,088 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:31,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:31,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:47:31,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:47:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:47:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:47:31,962 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-11-07 16:47:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:32,018 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 16:47:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:47:32,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 16:47:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:32,021 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:47:32,021 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 16:47:32,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:47:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 16:47:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 16:47:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 16:47:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 16:47:32,025 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-07 16:47:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:32,026 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 16:47:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:47:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 16:47:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 16:47:32,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:32,027 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:32,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:32,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1382240675, now seen corresponding path program 17 times [2018-11-07 16:47:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:32,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:32,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:32,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:32,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:32,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:32,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:32,284 INFO L194 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 [2018-11-07 16:47:32,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:32,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:32,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:47:32,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:32,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:32,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:33,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 16:47:33,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:33,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:47:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:47:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:47:33,385 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-11-07 16:47:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:33,549 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-07 16:47:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:47:33,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-07 16:47:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:33,550 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:47:33,551 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:47:33,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:47:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:47:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 16:47:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 16:47:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 16:47:33,556 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-07 16:47:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:33,557 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 16:47:33,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:47:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 16:47:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:47:33,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:33,558 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:33,558 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:33,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1753490855, now seen corresponding path program 18 times [2018-11-07 16:47:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:33,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:34,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:34,406 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:34,406 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:34,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:34,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:34,406 INFO L194 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 [2018-11-07 16:47:34,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:34,419 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:34,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:34,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:34,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:34,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 16:47:34,941 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:34,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:47:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:47:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:47:34,942 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-11-07 16:47:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:35,008 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 16:47:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:47:35,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-07 16:47:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:35,010 INFO L225 Difference]: With dead ends: 75 [2018-11-07 16:47:35,010 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:47:35,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:47:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:47:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-07 16:47:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 16:47:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-07 16:47:35,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-07 16:47:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:35,015 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-07 16:47:35,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:47:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-07 16:47:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 16:47:35,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:35,016 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:35,016 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:35,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2126816035, now seen corresponding path program 19 times [2018-11-07 16:47:35,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:35,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:35,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:35,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:35,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:35,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:35,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:35,380 INFO L194 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 [2018-11-07 16:47:35,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:35,389 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:35,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:35,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 16:47:36,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:47:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:47:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:47:36,047 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-11-07 16:47:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:36,143 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 16:47:36,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:47:36,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-07 16:47:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:36,145 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:47:36,145 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 16:47:36,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:47:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 16:47:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 16:47:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 16:47:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 16:47:36,150 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-07 16:47:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:36,150 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 16:47:36,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:47:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 16:47:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 16:47:36,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:36,151 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:36,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:36,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 108043225, now seen corresponding path program 20 times [2018-11-07 16:47:36,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:36,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:36,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:36,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:36,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:36,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:36,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:36,412 INFO L194 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 [2018-11-07 16:47:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:36,420 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:36,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 16:47:36,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:36,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:36,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:37,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:37,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 16:47:37,002 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:37,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:47:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:47:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:47:37,004 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-11-07 16:47:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:37,068 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 16:47:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:47:37,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-07 16:47:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:37,072 INFO L225 Difference]: With dead ends: 81 [2018-11-07 16:47:37,072 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 16:47:37,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:47:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 16:47:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 16:47:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 16:47:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 16:47:37,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-07 16:47:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:37,076 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 16:47:37,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:47:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 16:47:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:47:37,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:37,077 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:37,078 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:37,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1782764707, now seen corresponding path program 21 times [2018-11-07 16:47:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:37,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:37,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:37,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:37,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:37,506 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:37,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:37,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:37,507 INFO L194 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:37,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:37,515 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:37,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:37,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:37,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:37,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:38,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:38,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 16:47:38,156 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:38,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:47:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:47:38,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:47:38,158 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-11-07 16:47:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:38,407 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-07 16:47:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:47:38,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 16:47:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:38,409 INFO L225 Difference]: With dead ends: 84 [2018-11-07 16:47:38,409 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:47:38,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:47:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:47:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-07 16:47:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 16:47:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 16:47:38,413 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-07 16:47:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:38,413 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 16:47:38,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:47:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 16:47:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 16:47:38,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:38,414 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:38,415 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:38,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1949187417, now seen corresponding path program 22 times [2018-11-07 16:47:38,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:38,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:38,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:39,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:39,028 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:39,028 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:39,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:39,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:39,028 INFO L194 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 [2018-11-07 16:47:39,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:39,038 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:39,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:39,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:39,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:39,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 16:47:39,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:39,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:47:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:47:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:47:39,748 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-11-07 16:47:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:39,840 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 16:47:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:47:39,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 16:47:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:39,851 INFO L225 Difference]: With dead ends: 87 [2018-11-07 16:47:39,851 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 16:47:39,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:47:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 16:47:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-07 16:47:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 16:47:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-07 16:47:39,855 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-07 16:47:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:39,855 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-07 16:47:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:47:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-07 16:47:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:47:39,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:39,857 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:39,857 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:39,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1011489245, now seen corresponding path program 23 times [2018-11-07 16:47:39,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:39,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:39,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:40,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:40,229 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:40,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:40,230 INFO L194 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 [2018-11-07 16:47:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:40,238 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:40,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:47:40,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:40,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:40,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:40,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:40,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-07 16:47:40,977 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:40,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:47:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:47:40,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:47:40,979 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-11-07 16:47:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:41,059 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-07 16:47:41,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:47:41,059 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-07 16:47:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:41,060 INFO L225 Difference]: With dead ends: 90 [2018-11-07 16:47:41,061 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 16:47:41,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:47:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 16:47:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 16:47:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 16:47:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 16:47:41,066 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-07 16:47:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:41,066 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 16:47:41,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:47:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 16:47:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 16:47:41,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:41,067 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:41,068 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:41,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:41,068 INFO L82 PathProgramCache]: Analyzing trace with hash 512540377, now seen corresponding path program 24 times [2018-11-07 16:47:41,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:41,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:41,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:41,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:41,381 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:41,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:41,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:41,381 INFO L194 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 [2018-11-07 16:47:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:41,390 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:41,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:41,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:41,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:41,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:42,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:42,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 16:47:42,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:42,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:47:42,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:47:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:42,140 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-11-07 16:47:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:42,270 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-07 16:47:42,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:47:42,270 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 16:47:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:42,272 INFO L225 Difference]: With dead ends: 93 [2018-11-07 16:47:42,272 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 16:47:42,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:47:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 16:47:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 16:47:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:47:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 16:47:42,277 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-07 16:47:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:42,277 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 16:47:42,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:47:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 16:47:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 16:47:42,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:42,278 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:42,279 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:42,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1208625245, now seen corresponding path program 25 times [2018-11-07 16:47:42,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:42,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:42,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:42,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:43,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:43,457 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:43,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:43,457 INFO L194 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 [2018-11-07 16:47:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:43,467 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:43,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:43,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:44,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 16:47:44,752 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:44,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:47:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:47:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:47:44,754 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-11-07 16:47:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:44,833 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-07 16:47:44,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:47:44,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 16:47:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:44,835 INFO L225 Difference]: With dead ends: 96 [2018-11-07 16:47:44,835 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 16:47:44,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:47:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 16:47:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-07 16:47:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 16:47:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-07 16:47:44,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-07 16:47:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:44,840 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-07 16:47:44,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:47:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-07 16:47:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 16:47:44,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:44,842 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:44,842 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:44,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2124144551, now seen corresponding path program 26 times [2018-11-07 16:47:44,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:44,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:44,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:44,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:44,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:46,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:46,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:46,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:46,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:46,236 INFO L194 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:46,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:46,244 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:46,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 16:47:46,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:46,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:46,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:47,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 16:47:47,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:47,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 16:47:47,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 16:47:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 16:47:47,113 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 29 states. [2018-11-07 16:47:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:47,205 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 16:47:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:47:47,206 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-07 16:47:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:47,207 INFO L225 Difference]: With dead ends: 99 [2018-11-07 16:47:47,208 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 16:47:47,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 16:47:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 16:47:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-07 16:47:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 16:47:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-07 16:47:47,212 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-11-07 16:47:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:47,212 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-07 16:47:47,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 16:47:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-07 16:47:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 16:47:47,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:47,213 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:47,213 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:47,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1910155555, now seen corresponding path program 27 times [2018-11-07 16:47:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:47,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:47,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:47,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:47,585 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:47,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:47,585 INFO L194 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 [2018-11-07 16:47:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:47,595 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:47,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:47,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:47,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:47,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:48,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:48,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 16:47:48,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:48,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 16:47:48,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 16:47:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:47:48,536 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 30 states. [2018-11-07 16:47:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:48,628 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-07 16:47:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 16:47:48,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 16:47:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:48,630 INFO L225 Difference]: With dead ends: 102 [2018-11-07 16:47:48,630 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 16:47:48,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:47:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 16:47:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-07 16:47:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 16:47:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-07 16:47:48,634 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-11-07 16:47:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:48,635 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-07 16:47:48,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 16:47:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-07 16:47:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 16:47:48,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:48,636 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:48,636 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:48,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:48,636 INFO L82 PathProgramCache]: Analyzing trace with hash -695442983, now seen corresponding path program 28 times [2018-11-07 16:47:48,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:48,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:48,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:48,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:48,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:49,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:49,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:49,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:49,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:49,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:49,732 INFO L194 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 [2018-11-07 16:47:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:49,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:49,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:49,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:50,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:50,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-07 16:47:50,891 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:50,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:47:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:47:50,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:47:50,892 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 31 states. [2018-11-07 16:47:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:51,015 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-07 16:47:51,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:47:51,015 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-11-07 16:47:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:51,017 INFO L225 Difference]: With dead ends: 105 [2018-11-07 16:47:51,017 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 16:47:51,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:47:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 16:47:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-07 16:47:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 16:47:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-07 16:47:51,021 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-11-07 16:47:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:51,022 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-07 16:47:51,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:47:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-07 16:47:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 16:47:51,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:51,022 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:51,023 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:51,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1707320669, now seen corresponding path program 29 times [2018-11-07 16:47:51,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:51,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:51,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:51,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:51,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:51,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:51,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:51,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:51,436 INFO L194 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 [2018-11-07 16:47:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:51,445 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:51,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 16:47:51,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:51,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:51,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:52,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:52,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2018-11-07 16:47:52,632 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:52,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 16:47:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 16:47:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 16:47:52,633 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 32 states. [2018-11-07 16:47:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:52,907 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-07 16:47:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 16:47:52,908 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-11-07 16:47:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:52,909 INFO L225 Difference]: With dead ends: 108 [2018-11-07 16:47:52,909 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 16:47:52,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 16:47:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 16:47:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-07 16:47:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 16:47:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-11-07 16:47:52,914 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-11-07 16:47:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:52,914 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-11-07 16:47:52,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 16:47:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-07 16:47:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 16:47:52,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:52,915 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:52,915 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:52,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1780645031, now seen corresponding path program 30 times [2018-11-07 16:47:52,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:52,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:52,916 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:53,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:53,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:53,483 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:53,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:53,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:53,484 INFO L194 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 [2018-11-07 16:47:53,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:53,492 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:53,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:53,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:53,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:53,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 16:47:54,872 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:54,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 16:47:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 16:47:54,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:47:54,873 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 33 states. [2018-11-07 16:47:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:55,020 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 16:47:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 16:47:55,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-11-07 16:47:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:55,022 INFO L225 Difference]: With dead ends: 111 [2018-11-07 16:47:55,022 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 16:47:55,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:47:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 16:47:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-07 16:47:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-07 16:47:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-07 16:47:55,028 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-11-07 16:47:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:55,028 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-07 16:47:55,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 16:47:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-07 16:47:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 16:47:55,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:55,029 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:55,029 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:55,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:55,030 INFO L82 PathProgramCache]: Analyzing trace with hash 671945693, now seen corresponding path program 31 times [2018-11-07 16:47:55,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:55,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:55,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:55,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:55,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:55,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:55,479 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:55,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:55,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:55,479 INFO L194 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 [2018-11-07 16:47:55,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:55,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:55,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:55,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:56,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-07 16:47:56,626 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:56,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 16:47:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 16:47:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:47:56,628 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 34 states. [2018-11-07 16:47:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:56,741 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-07 16:47:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 16:47:56,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-11-07 16:47:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:56,743 INFO L225 Difference]: With dead ends: 114 [2018-11-07 16:47:56,743 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 16:47:56,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:47:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 16:47:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-07 16:47:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 16:47:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-11-07 16:47:56,749 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-11-07 16:47:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:56,749 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-11-07 16:47:56,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 16:47:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-07 16:47:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 16:47:56,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:56,750 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:56,751 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:56,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash -181435175, now seen corresponding path program 32 times [2018-11-07 16:47:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:57,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:57,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:57,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:57,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,359 INFO L194 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 [2018-11-07 16:47:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:57,367 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:57,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 16:47:57,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:57,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:57,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2018-11-07 16:47:58,668 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:58,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:47:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:47:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 16:47:58,669 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 35 states. [2018-11-07 16:47:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:58,809 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-07 16:47:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 16:47:58,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-11-07 16:47:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:58,811 INFO L225 Difference]: With dead ends: 117 [2018-11-07 16:47:58,811 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 16:47:58,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 16:47:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 16:47:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-07 16:47:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 16:47:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-07 16:47:58,815 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-11-07 16:47:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:58,815 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-07 16:47:58,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:47:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-07 16:47:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 16:47:58,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:58,816 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:58,816 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:58,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1339448739, now seen corresponding path program 33 times [2018-11-07 16:47:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:58,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:58,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:59,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:59,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:59,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:59,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:59,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:59,851 INFO L194 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 [2018-11-07 16:47:59,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:59,871 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:59,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:59,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:59,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:47:59,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:01,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-07 16:48:01,231 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:01,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:48:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:48:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 16:48:01,233 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 36 states. [2018-11-07 16:48:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:01,385 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-07 16:48:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 16:48:01,386 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-11-07 16:48:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:01,387 INFO L225 Difference]: With dead ends: 120 [2018-11-07 16:48:01,387 INFO L226 Difference]: Without dead ends: 115 [2018-11-07 16:48:01,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 16:48:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-07 16:48:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-07 16:48:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 16:48:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-11-07 16:48:01,390 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-11-07 16:48:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:01,392 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-11-07 16:48:01,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:48:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-07 16:48:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 16:48:01,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:01,393 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:01,393 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:01,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1750754905, now seen corresponding path program 34 times [2018-11-07 16:48:01,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:01,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:01,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:02,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:02,069 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:02,069 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:02,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:02,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:02,069 INFO L194 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 [2018-11-07 16:48:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:02,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:02,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:02,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:03,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:03,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-07 16:48:03,432 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:03,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:48:03,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:48:03,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 16:48:03,434 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 37 states. [2018-11-07 16:48:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:03,553 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 16:48:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:48:03,553 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-11-07 16:48:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:03,555 INFO L225 Difference]: With dead ends: 123 [2018-11-07 16:48:03,555 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 16:48:03,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 16:48:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 16:48:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 16:48:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 16:48:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-11-07 16:48:03,559 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-11-07 16:48:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:03,559 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-11-07 16:48:03,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:48:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-11-07 16:48:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 16:48:03,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:03,560 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:03,560 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:03,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash -616476451, now seen corresponding path program 35 times [2018-11-07 16:48:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:03,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:04,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:04,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:04,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:04,236 INFO L194 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 [2018-11-07 16:48:04,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:04,244 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:04,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 16:48:04,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:04,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:04,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:06,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:06,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 16:48:06,016 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:48:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:48:06,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:48:06,017 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 38 states. [2018-11-07 16:48:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:06,151 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-07 16:48:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 16:48:06,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-11-07 16:48:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:06,164 INFO L225 Difference]: With dead ends: 126 [2018-11-07 16:48:06,164 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 16:48:06,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:48:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 16:48:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-07 16:48:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 16:48:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-11-07 16:48:06,168 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-11-07 16:48:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:06,168 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-11-07 16:48:06,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:48:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-11-07 16:48:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 16:48:06,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:06,170 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:06,170 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:06,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 557197273, now seen corresponding path program 36 times [2018-11-07 16:48:06,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:06,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:06,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:07,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:07,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:07,002 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:07,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:07,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:07,002 INFO L194 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 [2018-11-07 16:48:07,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:07,011 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:07,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:07,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:07,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:07,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:08,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 16:48:08,883 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:08,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:48:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:48:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 16:48:08,884 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 39 states. [2018-11-07 16:48:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:09,030 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-07 16:48:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:48:09,031 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-11-07 16:48:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:09,032 INFO L225 Difference]: With dead ends: 129 [2018-11-07 16:48:09,032 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 16:48:09,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 16:48:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 16:48:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-07 16:48:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 16:48:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-07 16:48:09,037 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-11-07 16:48:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:09,037 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-07 16:48:09,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:48:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-07 16:48:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 16:48:09,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:09,038 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:09,038 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:09,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:09,039 INFO L82 PathProgramCache]: Analyzing trace with hash 142352221, now seen corresponding path program 37 times [2018-11-07 16:48:09,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:09,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:09,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:10,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:10,056 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:10,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:10,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:10,057 INFO L194 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 [2018-11-07 16:48:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:10,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:10,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:10,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:11,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:11,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-07 16:48:11,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:11,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:48:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:48:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 16:48:11,699 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 40 states. [2018-11-07 16:48:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:11,843 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-07 16:48:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:48:11,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-11-07 16:48:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:11,845 INFO L225 Difference]: With dead ends: 132 [2018-11-07 16:48:11,845 INFO L226 Difference]: Without dead ends: 127 [2018-11-07 16:48:11,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 16:48:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-07 16:48:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-07 16:48:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 16:48:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-11-07 16:48:11,849 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-11-07 16:48:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:11,850 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-11-07 16:48:11,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:48:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-11-07 16:48:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 16:48:11,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:11,851 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:11,851 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:11,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1885681319, now seen corresponding path program 38 times [2018-11-07 16:48:11,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:11,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:12,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:12,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:12,549 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:12,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:12,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:12,549 INFO L194 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 [2018-11-07 16:48:12,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:12,557 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:12,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 16:48:12,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:12,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:12,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:14,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:14,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2018-11-07 16:48:14,230 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:14,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 16:48:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 16:48:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 16:48:14,232 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 41 states. [2018-11-07 16:48:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:14,444 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-07 16:48:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 16:48:14,444 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-11-07 16:48:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:14,445 INFO L225 Difference]: With dead ends: 135 [2018-11-07 16:48:14,445 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 16:48:14,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 16:48:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 16:48:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-07 16:48:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 16:48:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-11-07 16:48:14,451 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-11-07 16:48:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:14,451 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-11-07 16:48:14,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 16:48:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-11-07 16:48:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 16:48:14,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:14,452 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:14,452 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:14,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1727918627, now seen corresponding path program 39 times [2018-11-07 16:48:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:14,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:14,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:14,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:14,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:15,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:15,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:15,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:15,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:15,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:15,319 INFO L194 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) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:15,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:15,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:15,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:15,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:15,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:15,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:17,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-07 16:48:17,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:17,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 16:48:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 16:48:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 16:48:17,113 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 42 states. [2018-11-07 16:48:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:17,435 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-07 16:48:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:48:17,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-11-07 16:48:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:17,438 INFO L225 Difference]: With dead ends: 138 [2018-11-07 16:48:17,438 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 16:48:17,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 16:48:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 16:48:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-07 16:48:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 16:48:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-11-07 16:48:17,443 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-11-07 16:48:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:17,443 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-11-07 16:48:17,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 16:48:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-11-07 16:48:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 16:48:17,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:17,444 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:17,445 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:17,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -513783079, now seen corresponding path program 40 times [2018-11-07 16:48:17,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:17,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:17,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:17,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:17,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:18,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:18,328 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:18,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:18,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:18,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:18,328 INFO L194 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 [2018-11-07 16:48:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:18,337 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:18,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:18,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:20,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 16:48:20,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:48:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:48:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:48:20,723 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 43 states. [2018-11-07 16:48:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:20,951 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-07 16:48:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 16:48:20,951 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-11-07 16:48:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:20,952 INFO L225 Difference]: With dead ends: 141 [2018-11-07 16:48:20,952 INFO L226 Difference]: Without dead ends: 136 [2018-11-07 16:48:20,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:48:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-07 16:48:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-07 16:48:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 16:48:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-07 16:48:20,957 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-11-07 16:48:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:20,957 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-07 16:48:20,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:48:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-07 16:48:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 16:48:20,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:20,959 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:20,959 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:20,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1878727773, now seen corresponding path program 41 times [2018-11-07 16:48:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:20,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:20,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:22,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:22,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:22,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:22,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:22,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:22,168 INFO L194 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 [2018-11-07 16:48:22,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:22,178 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:22,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 16:48:22,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:22,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:22,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:24,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:24,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2018-11-07 16:48:24,453 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:24,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:48:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:48:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 16:48:24,455 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 44 states. [2018-11-07 16:48:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:25,120 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-07 16:48:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 16:48:25,123 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 134 [2018-11-07 16:48:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:25,124 INFO L225 Difference]: With dead ends: 144 [2018-11-07 16:48:25,124 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 16:48:25,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 16:48:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 16:48:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-07 16:48:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 16:48:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-11-07 16:48:25,132 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-11-07 16:48:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:25,132 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-11-07 16:48:25,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 16:48:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-11-07 16:48:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 16:48:25,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:25,134 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:25,134 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:25,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2107724711, now seen corresponding path program 42 times [2018-11-07 16:48:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:25,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:25,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:25,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:26,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:26,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:26,174 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:26,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:26,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:26,174 INFO L194 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) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:26,183 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:26,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:26,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:26,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:26,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:28,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:28,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-07 16:48:28,402 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:28,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 16:48:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 16:48:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 16:48:28,404 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 45 states. [2018-11-07 16:48:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:28,535 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-07 16:48:28,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 16:48:28,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2018-11-07 16:48:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:28,537 INFO L225 Difference]: With dead ends: 147 [2018-11-07 16:48:28,537 INFO L226 Difference]: Without dead ends: 142 [2018-11-07 16:48:28,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 16:48:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-07 16:48:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-11-07 16:48:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 16:48:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-11-07 16:48:28,543 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-11-07 16:48:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-11-07 16:48:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 16:48:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-11-07 16:48:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 16:48:28,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:28,545 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:28,545 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:28,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1921993437, now seen corresponding path program 43 times [2018-11-07 16:48:28,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:28,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:28,546 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:29,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:29,627 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:29,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:29,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:29,627 INFO L194 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 [2018-11-07 16:48:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:29,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:29,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:29,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:32,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:32,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-07 16:48:32,697 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:32,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 16:48:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 16:48:32,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 16:48:32,698 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 46 states. [2018-11-07 16:48:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:32,830 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-07 16:48:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 16:48:32,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 140 [2018-11-07 16:48:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:32,832 INFO L225 Difference]: With dead ends: 150 [2018-11-07 16:48:32,832 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 16:48:32,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 16:48:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 16:48:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-07 16:48:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 16:48:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-11-07 16:48:32,837 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-11-07 16:48:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:32,837 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-11-07 16:48:32,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 16:48:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-11-07 16:48:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 16:48:32,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:32,839 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:32,839 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:32,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1670517287, now seen corresponding path program 44 times [2018-11-07 16:48:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:32,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:34,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:34,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:34,592 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:34,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:34,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:34,592 INFO L194 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 [2018-11-07 16:48:34,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:34,601 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:34,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 16:48:34,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:34,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:34,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:37,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2018-11-07 16:48:37,116 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:37,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 16:48:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 16:48:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 16:48:37,117 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 47 states. [2018-11-07 16:48:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:37,242 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-07 16:48:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 16:48:37,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-11-07 16:48:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:37,244 INFO L225 Difference]: With dead ends: 153 [2018-11-07 16:48:37,244 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 16:48:37,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 16:48:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 16:48:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-07 16:48:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 16:48:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-07 16:48:37,249 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-11-07 16:48:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:37,250 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-07 16:48:37,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 16:48:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-07 16:48:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 16:48:37,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:37,251 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:37,251 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:37,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash 132553053, now seen corresponding path program 45 times [2018-11-07 16:48:37,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:37,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:37,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:37,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:38,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:38,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:38,150 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:38,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:38,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:38,150 INFO L194 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 [2018-11-07 16:48:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:38,160 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:38,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:38,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:38,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:38,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 16:48:40,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:40,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 16:48:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 16:48:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 16:48:40,723 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 48 states. [2018-11-07 16:48:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:40,854 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-11-07 16:48:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 16:48:40,854 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2018-11-07 16:48:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:40,856 INFO L225 Difference]: With dead ends: 156 [2018-11-07 16:48:40,856 INFO L226 Difference]: Without dead ends: 151 [2018-11-07 16:48:40,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 16:48:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-07 16:48:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-07 16:48:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-07 16:48:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-11-07 16:48:40,861 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-11-07 16:48:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:40,861 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-11-07 16:48:40,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 16:48:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-11-07 16:48:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 16:48:40,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:40,862 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:40,862 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:40,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1754919079, now seen corresponding path program 46 times [2018-11-07 16:48:40,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:40,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:40,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:40,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:41,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:41,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:41,867 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:41,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:41,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:41,868 INFO L194 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 [2018-11-07 16:48:41,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:41,877 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:41,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:41,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:44,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:44,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 16:48:44,238 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:44,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 16:48:44,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 16:48:44,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 16:48:44,240 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 49 states. [2018-11-07 16:48:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:44,408 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-07 16:48:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 16:48:44,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 149 [2018-11-07 16:48:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:44,410 INFO L225 Difference]: With dead ends: 159 [2018-11-07 16:48:44,410 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 16:48:44,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 16:48:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 16:48:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 16:48:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 16:48:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-11-07 16:48:44,414 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-11-07 16:48:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:44,414 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-11-07 16:48:44,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 16:48:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-11-07 16:48:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-07 16:48:44,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:44,415 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:44,416 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:44,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1725364259, now seen corresponding path program 47 times [2018-11-07 16:48:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:44,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:45,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:45,571 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:45,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:45,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:45,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:45,571 INFO L194 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 [2018-11-07 16:48:45,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:45,581 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:45,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 16:48:45,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:45,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:45,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:48,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:48,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2018-11-07 16:48:48,123 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:48,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 16:48:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 16:48:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 16:48:48,124 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 50 states. [2018-11-07 16:48:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:48,629 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-11-07 16:48:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 16:48:48,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2018-11-07 16:48:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:48,630 INFO L225 Difference]: With dead ends: 162 [2018-11-07 16:48:48,630 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 16:48:48,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 16:48:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 16:48:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-07 16:48:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-07 16:48:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-11-07 16:48:48,635 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-11-07 16:48:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:48,636 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-11-07 16:48:48,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 16:48:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-11-07 16:48:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 16:48:48,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:48,637 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:48,637 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:48,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1726017319, now seen corresponding path program 48 times [2018-11-07 16:48:48,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:48,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:48,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:49,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:49,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:49,757 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:49,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:49,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:49,758 INFO L194 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 [2018-11-07 16:48:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:49,765 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:49,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:49,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:49,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:49,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:52,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:52,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-07 16:48:52,552 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:52,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 16:48:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 16:48:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 16:48:52,554 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 51 states. [2018-11-07 16:48:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:52,722 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-11-07 16:48:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:48:52,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 155 [2018-11-07 16:48:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:52,724 INFO L225 Difference]: With dead ends: 165 [2018-11-07 16:48:52,724 INFO L226 Difference]: Without dead ends: 160 [2018-11-07 16:48:52,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 16:48:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-07 16:48:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-07 16:48:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 16:48:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-07 16:48:52,728 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-11-07 16:48:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:52,729 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-07 16:48:52,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 16:48:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-07 16:48:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 16:48:52,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:52,729 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:52,730 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:52,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash 293508701, now seen corresponding path program 49 times [2018-11-07 16:48:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:52,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:52,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:53,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:53,775 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:53,775 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:53,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:53,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:53,775 INFO L194 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 [2018-11-07 16:48:53,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:53,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:53,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:53,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:56,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:56,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-07 16:48:56,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:56,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 16:48:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 16:48:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:56,779 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 52 states. [2018-11-07 16:48:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:56,940 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-11-07 16:48:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 16:48:56,941 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2018-11-07 16:48:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:56,942 INFO L225 Difference]: With dead ends: 168 [2018-11-07 16:48:56,943 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 16:48:56,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 16:48:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 16:48:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-11-07 16:48:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-07 16:48:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-11-07 16:48:56,947 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-11-07 16:48:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:56,947 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-11-07 16:48:56,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 16:48:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-11-07 16:48:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 16:48:56,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:56,949 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:56,949 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:56,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 91288153, now seen corresponding path program 50 times [2018-11-07 16:48:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:58,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:58,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:58,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:58,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:58,192 INFO L194 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 [2018-11-07 16:48:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:58,200 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:58,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-07 16:48:58,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:58,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:58,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2018-11-07 16:49:01,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:01,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 16:49:01,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 16:49:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 16:49:01,660 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 53 states. [2018-11-07 16:49:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:01,854 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-07 16:49:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 16:49:01,854 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 161 [2018-11-07 16:49:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:01,855 INFO L225 Difference]: With dead ends: 171 [2018-11-07 16:49:01,855 INFO L226 Difference]: Without dead ends: 166 [2018-11-07 16:49:01,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 16:49:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-07 16:49:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-11-07 16:49:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-07 16:49:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-11-07 16:49:01,859 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-11-07 16:49:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:01,859 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-11-07 16:49:01,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 16:49:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-11-07 16:49:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 16:49:01,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:01,860 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:01,860 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:01,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1578058973, now seen corresponding path program 51 times [2018-11-07 16:49:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:01,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:01,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:04,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:04,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:04,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:04,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:04,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:04,477 INFO L194 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 [2018-11-07 16:49:04,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:04,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:04,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:04,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:04,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:04,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:07,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-07 16:49:07,702 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:07,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 16:49:07,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 16:49:07,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 16:49:07,704 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 54 states. [2018-11-07 16:49:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:07,900 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-11-07 16:49:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 16:49:07,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2018-11-07 16:49:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:07,901 INFO L225 Difference]: With dead ends: 174 [2018-11-07 16:49:07,901 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 16:49:07,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 16:49:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 16:49:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-11-07 16:49:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-07 16:49:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-11-07 16:49:07,905 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-11-07 16:49:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:07,905 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-11-07 16:49:07,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 16:49:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-11-07 16:49:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 16:49:07,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:07,906 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:07,906 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:07,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -30166055, now seen corresponding path program 52 times [2018-11-07 16:49:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:07,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:07,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:10,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:10,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:10,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:10,121 INFO L194 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 [2018-11-07 16:49:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:10,131 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:10,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:10,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:13,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:13,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-07 16:49:13,519 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:13,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 16:49:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 16:49:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 16:49:13,520 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 55 states. [2018-11-07 16:49:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:13,727 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-11-07 16:49:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:49:13,727 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 167 [2018-11-07 16:49:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:13,728 INFO L225 Difference]: With dead ends: 177 [2018-11-07 16:49:13,728 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 16:49:13,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 16:49:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 16:49:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-07 16:49:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 16:49:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-07 16:49:13,732 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-11-07 16:49:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:13,732 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-07 16:49:13,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 16:49:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-07 16:49:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 16:49:13,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:13,734 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:13,734 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:13,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash -301788323, now seen corresponding path program 53 times [2018-11-07 16:49:13,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:13,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:13,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:13,735 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:15,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:15,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:15,173 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:15,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:15,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:15,174 INFO L194 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 [2018-11-07 16:49:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:15,183 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:15,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 16:49:15,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:15,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:15,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:18,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2018-11-07 16:49:18,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 16:49:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 16:49:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 16:49:18,632 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 56 states. [2018-11-07 16:49:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:18,810 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-11-07 16:49:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 16:49:18,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 170 [2018-11-07 16:49:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:18,812 INFO L225 Difference]: With dead ends: 180 [2018-11-07 16:49:18,813 INFO L226 Difference]: Without dead ends: 175 [2018-11-07 16:49:18,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 16:49:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-07 16:49:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-11-07 16:49:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 16:49:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-11-07 16:49:18,817 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-11-07 16:49:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:18,818 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-11-07 16:49:18,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 16:49:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-11-07 16:49:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-07 16:49:18,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:18,819 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:18,819 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:18,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash -482388647, now seen corresponding path program 54 times [2018-11-07 16:49:18,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:18,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:18,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:20,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:20,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:20,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:20,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:20,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:20,057 INFO L194 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 [2018-11-07 16:49:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:20,068 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:20,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:20,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:20,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:20,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:23,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:23,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-07 16:49:23,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:23,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 16:49:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 16:49:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 16:49:23,909 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 57 states. [2018-11-07 16:49:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:24,110 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-07 16:49:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 16:49:24,110 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 173 [2018-11-07 16:49:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:24,111 INFO L225 Difference]: With dead ends: 183 [2018-11-07 16:49:24,111 INFO L226 Difference]: Without dead ends: 178 [2018-11-07 16:49:24,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 16:49:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-07 16:49:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-11-07 16:49:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 16:49:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-11-07 16:49:24,116 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-11-07 16:49:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:24,117 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-11-07 16:49:24,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 16:49:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-11-07 16:49:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 16:49:24,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:24,118 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:24,118 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:24,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 847380957, now seen corresponding path program 55 times [2018-11-07 16:49:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:24,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:24,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:26,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:26,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:26,606 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:26,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:26,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:26,606 INFO L194 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 [2018-11-07 16:49:26,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:26,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:26,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:26,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:30,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:30,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-07 16:49:30,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:30,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 16:49:30,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 16:49:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 16:49:30,139 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 58 states. [2018-11-07 16:49:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:30,512 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-11-07 16:49:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 16:49:30,512 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 176 [2018-11-07 16:49:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:30,513 INFO L225 Difference]: With dead ends: 186 [2018-11-07 16:49:30,513 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 16:49:30,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 16:49:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 16:49:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-07 16:49:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-07 16:49:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-11-07 16:49:30,518 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-11-07 16:49:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:30,519 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-11-07 16:49:30,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 16:49:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-11-07 16:49:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 16:49:30,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:30,520 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:30,520 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:30,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -764684583, now seen corresponding path program 56 times [2018-11-07 16:49:30,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:30,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:30,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:30,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:32,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:32,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:32,101 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:32,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:32,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:32,101 INFO L194 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 [2018-11-07 16:49:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:32,110 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:32,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-11-07 16:49:32,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:32,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:32,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:35,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:35,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 16:49:35,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:35,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 16:49:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 16:49:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 16:49:35,601 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 59 states. [2018-11-07 16:49:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:35,836 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-11-07 16:49:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 16:49:35,836 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 179 [2018-11-07 16:49:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:35,837 INFO L225 Difference]: With dead ends: 189 [2018-11-07 16:49:35,838 INFO L226 Difference]: Without dead ends: 184 [2018-11-07 16:49:35,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 16:49:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-07 16:49:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-07 16:49:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 16:49:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-07 16:49:35,843 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-11-07 16:49:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:35,843 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-07 16:49:35,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 16:49:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-07 16:49:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 16:49:35,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:35,844 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:35,844 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:35,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash 515117149, now seen corresponding path program 57 times [2018-11-07 16:49:35,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:35,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:35,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:35,846 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:37,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:37,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:37,490 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:37,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:37,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:37,490 INFO L194 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 [2018-11-07 16:49:37,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:37,499 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:37,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:37,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:37,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:37,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:41,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:41,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 16:49:41,063 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:41,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 16:49:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 16:49:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 16:49:41,064 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 60 states. [2018-11-07 16:49:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:41,294 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-11-07 16:49:41,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 16:49:41,294 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 182 [2018-11-07 16:49:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:41,295 INFO L225 Difference]: With dead ends: 192 [2018-11-07 16:49:41,296 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 16:49:41,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 16:49:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 16:49:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-07 16:49:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 16:49:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-11-07 16:49:41,300 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-11-07 16:49:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:41,300 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-11-07 16:49:41,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 16:49:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-11-07 16:49:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 16:49:41,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:41,301 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:41,302 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:41,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:41,302 INFO L82 PathProgramCache]: Analyzing trace with hash 663828569, now seen corresponding path program 58 times [2018-11-07 16:49:41,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:41,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:41,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:42,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:42,915 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:42,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:42,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:42,915 INFO L194 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 [2018-11-07 16:49:42,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:42,925 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:42,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:43,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-07 16:49:47,194 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:47,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-07 16:49:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-07 16:49:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 16:49:47,195 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 61 states. [2018-11-07 16:49:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:47,391 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-07 16:49:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-07 16:49:47,392 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 185 [2018-11-07 16:49:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:47,393 INFO L225 Difference]: With dead ends: 195 [2018-11-07 16:49:47,394 INFO L226 Difference]: Without dead ends: 190 [2018-11-07 16:49:47,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-11-07 16:49:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-07 16:49:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-11-07 16:49:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 16:49:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-11-07 16:49:47,399 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-11-07 16:49:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:47,399 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-11-07 16:49:47,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-07 16:49:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-11-07 16:49:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 16:49:47,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:47,400 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:47,401 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:47,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1480507683, now seen corresponding path program 59 times [2018-11-07 16:49:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:47,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:48,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:48,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:48,792 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:48,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:48,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:48,792 INFO L194 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 [2018-11-07 16:49:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:48,800 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:48,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-11-07 16:49:48,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:48,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:48,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:53,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:53,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2018-11-07 16:49:53,020 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:53,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-07 16:49:53,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-07 16:49:53,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 16:49:53,021 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 62 states. [2018-11-07 16:49:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:53,278 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-11-07 16:49:53,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-07 16:49:53,278 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 188 [2018-11-07 16:49:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:53,279 INFO L225 Difference]: With dead ends: 198 [2018-11-07 16:49:53,280 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 16:49:53,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-11-07 16:49:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 16:49:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-11-07 16:49:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-07 16:49:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-11-07 16:49:53,283 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-11-07 16:49:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:53,283 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-11-07 16:49:53,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-07 16:49:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-11-07 16:49:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 16:49:53,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:53,284 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:53,284 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -58230311, now seen corresponding path program 60 times [2018-11-07 16:49:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:53,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:53,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:54,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:54,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:54,700 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:54,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:54,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:54,701 INFO L194 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 [2018-11-07 16:49:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:54,709 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:54,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:54,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:54,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:54,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-07 16:49:58,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-07 16:49:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-07 16:49:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 16:49:58,906 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 63 states. [2018-11-07 16:50:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:00,175 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-11-07 16:50:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-07 16:50:00,175 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 191 [2018-11-07 16:50:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:00,176 INFO L225 Difference]: With dead ends: 201 [2018-11-07 16:50:00,177 INFO L226 Difference]: Without dead ends: 196 [2018-11-07 16:50:00,177 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-11-07 16:50:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-07 16:50:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-07 16:50:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 16:50:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-07 16:50:00,181 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-11-07 16:50:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:00,182 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-07 16:50:00,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-07 16:50:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-07 16:50:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 16:50:00,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:00,183 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:00,183 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:00,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1154583901, now seen corresponding path program 61 times [2018-11-07 16:50:00,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:00,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:00,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:00,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:00,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:02,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:02,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:02,907 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:02,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:02,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:02,907 INFO L194 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 [2018-11-07 16:50:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:02,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:02,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:02,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:06,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:06,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-07 16:50:06,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:06,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-07 16:50:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-07 16:50:06,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 16:50:06,997 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 64 states. [2018-11-07 16:50:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:07,324 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-11-07 16:50:07,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-07 16:50:07,324 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2018-11-07 16:50:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:07,325 INFO L225 Difference]: With dead ends: 204 [2018-11-07 16:50:07,325 INFO L226 Difference]: Without dead ends: 199 [2018-11-07 16:50:07,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 16:50:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-07 16:50:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-07 16:50:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-07 16:50:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-11-07 16:50:07,331 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-11-07 16:50:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:07,331 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-11-07 16:50:07,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-07 16:50:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-11-07 16:50:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 16:50:07,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:07,332 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:07,332 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:07,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1457087655, now seen corresponding path program 62 times [2018-11-07 16:50:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:07,334 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:09,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:09,338 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:09,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:09,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:09,339 INFO L194 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 [2018-11-07 16:50:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:09,347 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:09,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-11-07 16:50:09,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:09,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:09,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2018-11-07 16:50:13,940 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:13,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-07 16:50:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-07 16:50:13,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 16:50:13,941 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 65 states. [2018-11-07 16:50:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:14,226 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-07 16:50:14,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 16:50:14,227 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 197 [2018-11-07 16:50:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:14,228 INFO L225 Difference]: With dead ends: 207 [2018-11-07 16:50:14,228 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 16:50:14,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-11-07 16:50:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 16:50:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-11-07 16:50:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 16:50:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-11-07 16:50:14,233 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-11-07 16:50:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:14,233 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-11-07 16:50:14,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-07 16:50:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-11-07 16:50:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 16:50:14,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:14,235 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:14,235 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:14,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1863121885, now seen corresponding path program 63 times [2018-11-07 16:50:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:14,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:14,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:16,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:16,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:16,051 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:16,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:16,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:16,051 INFO L194 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 [2018-11-07 16:50:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:16,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:16,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:16,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:16,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:16,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:21,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:21,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-07 16:50:21,850 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:21,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-07 16:50:21,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-07 16:50:21,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 16:50:21,851 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 66 states. [2018-11-07 16:50:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:22,129 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-11-07 16:50:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-07 16:50:22,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 200 [2018-11-07 16:50:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:22,130 INFO L225 Difference]: With dead ends: 210 [2018-11-07 16:50:22,130 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 16:50:22,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-11-07 16:50:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 16:50:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-11-07 16:50:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-07 16:50:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-11-07 16:50:22,133 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-11-07 16:50:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:22,134 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-11-07 16:50:22,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-07 16:50:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-11-07 16:50:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 16:50:22,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:22,135 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:22,135 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:22,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1128701145, now seen corresponding path program 64 times [2018-11-07 16:50:22,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:22,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:22,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:22,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:22,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:24,143 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:24,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,143 INFO L194 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 [2018-11-07 16:50:24,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:24,152 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:24,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:24,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:29,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:29,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-07 16:50:29,008 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:29,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-07 16:50:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-07 16:50:29,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 16:50:29,009 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 67 states. [2018-11-07 16:50:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:29,224 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-11-07 16:50:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-07 16:50:29,225 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 203 [2018-11-07 16:50:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:29,226 INFO L225 Difference]: With dead ends: 213 [2018-11-07 16:50:29,226 INFO L226 Difference]: Without dead ends: 208 [2018-11-07 16:50:29,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 16:50:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-07 16:50:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-07 16:50:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 16:50:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-11-07 16:50:29,230 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-11-07 16:50:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:29,230 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-11-07 16:50:29,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-07 16:50:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-11-07 16:50:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 16:50:29,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:29,231 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:29,232 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:29,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 563841629, now seen corresponding path program 65 times [2018-11-07 16:50:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:29,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:30,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:30,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:30,814 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:30,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:30,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:30,814 INFO L194 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 [2018-11-07 16:50:30,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:30,823 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:30,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-11-07 16:50:30,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:30,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:30,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2018-11-07 16:50:35,735 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:35,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-07 16:50:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-07 16:50:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 16:50:35,737 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 68 states. [2018-11-07 16:50:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:35,952 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-11-07 16:50:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 16:50:35,952 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 206 [2018-11-07 16:50:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:35,953 INFO L225 Difference]: With dead ends: 216 [2018-11-07 16:50:35,954 INFO L226 Difference]: Without dead ends: 211 [2018-11-07 16:50:35,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-11-07 16:50:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-07 16:50:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-11-07 16:50:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 16:50:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-11-07 16:50:35,958 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-11-07 16:50:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:35,958 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-11-07 16:50:35,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-07 16:50:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-11-07 16:50:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 16:50:35,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:35,960 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:35,960 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:35,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 515866201, now seen corresponding path program 66 times [2018-11-07 16:50:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:35,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:35,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:37,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:37,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:37,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:37,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:37,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:37,640 INFO L194 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 [2018-11-07 16:50:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:37,648 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:37,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:37,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:37,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:37,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:42,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-07 16:50:42,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:42,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 16:50:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 16:50:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 16:50:42,717 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 69 states. [2018-11-07 16:50:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:43,273 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-11-07 16:50:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 16:50:43,274 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-11-07 16:50:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:43,275 INFO L225 Difference]: With dead ends: 219 [2018-11-07 16:50:43,275 INFO L226 Difference]: Without dead ends: 214 [2018-11-07 16:50:43,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-11-07 16:50:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-07 16:50:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-11-07 16:50:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-07 16:50:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-11-07 16:50:43,280 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-11-07 16:50:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:43,280 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-11-07 16:50:43,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 16:50:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-11-07 16:50:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 16:50:43,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:43,282 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:43,282 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:43,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1504000221, now seen corresponding path program 67 times [2018-11-07 16:50:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:43,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:43,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:45,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:45,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:45,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,046 INFO L194 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 [2018-11-07 16:50:45,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:45,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:45,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:50,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:50,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-07 16:50:50,206 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:50,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 16:50:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 16:50:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 16:50:50,208 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 70 states. [2018-11-07 16:50:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:50,510 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-11-07 16:50:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 16:50:50,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 212 [2018-11-07 16:50:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:50,512 INFO L225 Difference]: With dead ends: 222 [2018-11-07 16:50:50,512 INFO L226 Difference]: Without dead ends: 217 [2018-11-07 16:50:50,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-11-07 16:50:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-07 16:50:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-11-07 16:50:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-07 16:50:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-11-07 16:50:50,517 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-11-07 16:50:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:50,517 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-11-07 16:50:50,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 16:50:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-11-07 16:50:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 16:50:50,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:50,519 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:50,519 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1298743257, now seen corresponding path program 68 times [2018-11-07 16:50:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:50,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:50,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:52,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:52,283 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:52,283 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:52,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:52,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:52,283 INFO L194 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 [2018-11-07 16:50:52,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:52,303 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:52,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-11-07 16:50:52,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:52,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:52,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-07 16:50:57,701 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:57,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 16:50:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 16:50:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 16:50:57,703 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 71 states. [2018-11-07 16:50:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:57,950 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-11-07 16:50:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 16:50:57,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 215 [2018-11-07 16:50:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:57,951 INFO L225 Difference]: With dead ends: 225 [2018-11-07 16:50:57,951 INFO L226 Difference]: Without dead ends: 220 [2018-11-07 16:50:57,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 16:50:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-07 16:50:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-11-07 16:50:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 16:50:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-11-07 16:50:57,955 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-11-07 16:50:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:57,955 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-11-07 16:50:57,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 16:50:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-11-07 16:50:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-07 16:50:57,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:57,956 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:57,956 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:57,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:57,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1773009059, now seen corresponding path program 69 times [2018-11-07 16:50:57,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:57,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:57,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:57,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:00,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:00,069 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:00,069 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:00,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:00,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:00,069 INFO L194 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 [2018-11-07 16:51:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:51:00,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:51:00,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:51:00,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:51:00,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:00,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:05,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-07 16:51:05,561 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:05,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 16:51:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 16:51:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-11-07 16:51:05,562 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 72 states. [2018-11-07 16:51:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:05,800 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-11-07 16:51:05,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 16:51:05,800 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 218 [2018-11-07 16:51:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:05,802 INFO L225 Difference]: With dead ends: 228 [2018-11-07 16:51:05,802 INFO L226 Difference]: Without dead ends: 223 [2018-11-07 16:51:05,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-11-07 16:51:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-07 16:51:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-11-07 16:51:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-07 16:51:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-11-07 16:51:05,806 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-11-07 16:51:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:05,806 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-11-07 16:51:05,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 16:51:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-11-07 16:51:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 16:51:05,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:05,807 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:05,808 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:05,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 521920857, now seen corresponding path program 70 times [2018-11-07 16:51:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:05,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:05,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:51:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:05,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:07,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:07,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:07,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:07,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:07,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:07,727 INFO L194 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 [2018-11-07 16:51:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:51:07,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:51:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:07,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:07,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 16:51:11,072 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 16:51:11,272 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:51:11,273 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:51:11,279 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:51:11,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:11 BoogieIcfgContainer [2018-11-07 16:51:11,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:51:11,280 INFO L168 Benchmark]: Toolchain (without parser) took 232509.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 675.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -328.5 MB). Peak memory consumption was 347.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:11,281 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:11,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:11,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:11,282 INFO L168 Benchmark]: Boogie Preprocessor took 20.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:11,283 INFO L168 Benchmark]: RCFGBuilder took 296.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:11,283 INFO L168 Benchmark]: TraceAbstraction took 231852.80 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -69.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 458.9 MB). Peak memory consumption was 389.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:11,286 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 296.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231852.80 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -69.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 458.9 MB). Peak memory consumption was 389.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 71,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 118 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 231.7s OverallTime, 72 OverallIterations, 71 TraceHistogramMax, 13.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 2485 SDslu, 16725 SDs, 0 SdLazy, 6890 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18566 GetRequests, 13597 SyntacticMatches, 0 SemanticMatches, 4969 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 200.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 70 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 205.7s InterpolantComputationTime, 16029 NumberOfCodeBlocks, 16029 NumberOfCodeBlocksAsserted, 968 NumberOfCheckSat, 23824 ConstructedInterpolants, 0 QuantifiedInterpolants, 10049036 SizeOfPredicates, 69 NumberOfNonLiveVariables, 11247 ConjunctsInSsa, 2553 ConjunctsInUnsatCore, 209 InterpolantComputations, 2 PerfectInterpolantSequences, 0/507150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown