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-LIM.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:42:11,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:42:11,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:42:11,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:42:11,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:42:11,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:42:11,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:42:11,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:42:11,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:42:11,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:42:11,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:42:11,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:42:11,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:42:11,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:42:11,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:42:11,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:42:11,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:42:11,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:42:11,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:42:11,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:42:11,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:42:11,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:42:11,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:42:11,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:42:11,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:42:11,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:42:11,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:42:11,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:42:11,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:42:11,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:42:11,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:42:11,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:42:11,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:42:11,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:42:11,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:42:11,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:42:11,661 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-LIM.epf [2018-11-12 20:42:11,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:42:11,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:42:11,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:42:11,678 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:42:11,679 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:42:11,679 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:42:11,679 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:42:11,679 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:42:11,680 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:42:11,680 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:42:11,680 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:42:11,680 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:42:11,680 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:42:11,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:42:11,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:42:11,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:42:11,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:42:11,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:42:11,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:42:11,682 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:42:11,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:42:11,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:42:11,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:42:11,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:42:11,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:42:11,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:42:11,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:42:11,684 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:42:11,684 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:42:11,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:42:11,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:42:11,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:42:11,685 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:42:11,685 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:42:11,686 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:42:11,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:42:11,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:42:11,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:42:11,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:42:11,758 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:42:11,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i [2018-11-12 20:42:11,830 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8625b192/c2d611f429bd4a849b15514dfacfc2ae/FLAGb5911459b [2018-11-12 20:42:12,309 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:42:12,310 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet_true-unreach-call_true-termination.i [2018-11-12 20:42:12,316 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8625b192/c2d611f429bd4a849b15514dfacfc2ae/FLAGb5911459b [2018-11-12 20:42:12,331 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8625b192/c2d611f429bd4a849b15514dfacfc2ae [2018-11-12 20:42:12,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:42:12,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:42:12,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:42:12,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:42:12,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:42:12,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f2c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12, skipping insertion in model container [2018-11-12 20:42:12,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:42:12,385 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:42:12,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:42:12,600 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:42:12,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:42:12,632 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:42:12,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12 WrapperNode [2018-11-12 20:42:12,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:42:12,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:42:12,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:42:12,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:42:12,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:42:12,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:42:12,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:42:12,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:42:12,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (1/1) ... [2018-11-12 20:42:12,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:42:12,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:42:12,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:42:12,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:42:12,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (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-12 20:42:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:42:12,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:42:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:42:12,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:42:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:42:12,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:42:12,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:42:12,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:42:12,990 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:42:12,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:42:12 BoogieIcfgContainer [2018-11-12 20:42:12,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:42:12,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:42:12,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:42:12,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:42:12,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:42:12" (1/3) ... [2018-11-12 20:42:12,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49fe56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:42:12, skipping insertion in model container [2018-11-12 20:42:12,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:12" (2/3) ... [2018-11-12 20:42:12,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c49fe56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:42:12, skipping insertion in model container [2018-11-12 20:42:12,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:42:12" (3/3) ... [2018-11-12 20:42:12,999 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet_true-unreach-call_true-termination.i [2018-11-12 20:42:13,010 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:42:13,018 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:42:13,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:42:13,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:42:13,110 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:42:13,110 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:42:13,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:42:13,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:42:13,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:42:13,111 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:42:13,111 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:42:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-12 20:42:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:42:13,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:13,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:13,149 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:13,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-12 20:42:13,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:13,263 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-12 20:42:13,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:13,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:42:13,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:13,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:42:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:42:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:42:13,287 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-12 20:42:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:13,307 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-12 20:42:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:42:13,308 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:42:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:13,317 INFO L225 Difference]: With dead ends: 32 [2018-11-12 20:42:13,317 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:42:13,320 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-12 20:42:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:42:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:42:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:42:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-12 20:42:13,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-12 20:42:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:13,354 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-12 20:42:13,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:42:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-12 20:42:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:42:13,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:13,356 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:13,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:13,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1289299715, now seen corresponding path program 1 times [2018-11-12 20:42:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:13,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:13,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:13,444 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-12 20:42:13,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:13,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:42:13,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:13,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:42:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:42:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:42:13,448 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-12 20:42:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:13,495 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-12 20:42:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:42:13,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:42:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:13,497 INFO L225 Difference]: With dead ends: 21 [2018-11-12 20:42:13,497 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:42:13,498 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-12 20:42:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:42:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-12 20:42:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-12 20:42:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-12 20:42:13,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-12 20:42:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:13,502 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-12 20:42:13,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:42:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-12 20:42:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:42:13,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:13,503 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:13,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:13,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:13,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1003978365, now seen corresponding path program 1 times [2018-11-12 20:42:13,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:13,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:13,595 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-12 20:42:13,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:13,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:13,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:42:13,599 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [25], [28], [30], [36], [37], [38], [40] [2018-11-12 20:42:13,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:42:13,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:42:13,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:42:13,881 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Performed 259 root evaluator evaluations with a maximum evaluation depth of 3. Performed 259 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-12 20:42:13,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:13,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:42:13,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:13,916 INFO L192 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-12 20:42:13,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:13,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:13,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:13,994 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-12 20:42:13,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:14,063 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-12 20:42:14,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:14,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-11-12 20:42:14,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:14,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:42:14,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:42:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:42:14,089 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-11-12 20:42:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:14,149 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-12 20:42:14,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:42:14,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:42:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:14,150 INFO L225 Difference]: With dead ends: 23 [2018-11-12 20:42:14,150 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:42:14,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:42:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:42:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:42:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:42:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-12 20:42:14,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-11-12 20:42:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:14,156 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-12 20:42:14,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:42:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-12 20:42:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:42:14,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:14,157 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:14,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:14,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash 6482173, now seen corresponding path program 2 times [2018-11-12 20:42:14,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:14,292 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-12 20:42:14,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:14,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:14,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:14,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,294 INFO L192 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-12 20:42:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:14,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:14,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:42:14,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:14,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:14,468 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-12 20:42:14,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:14,778 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-12 20:42:14,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:14,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:42:14,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:14,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:42:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:42:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:42:14,800 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-12 20:42:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:14,867 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-12 20:42:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:42:14,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-12 20:42:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:14,869 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:42:14,870 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:42:14,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:42:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:42:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-12 20:42:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:42:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-12 20:42:14,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-12 20:42:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:14,876 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-12 20:42:14,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:42:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-12 20:42:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:42:14,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:14,877 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:14,878 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:14,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash 476147325, now seen corresponding path program 3 times [2018-11-12 20:42:14,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:14,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,108 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-12 20:42:15,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:15,109 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:15,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:15,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,109 INFO L192 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-12 20:42:15,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:15,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:15,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:15,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:15,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:15,158 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-12 20:42:15,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:15,403 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-12 20:42:15,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:15,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-12 20:42:15,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:15,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:42:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:42:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:42:15,432 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-12 20:42:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:15,658 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-12 20:42:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:42:15,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-12 20:42:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:15,660 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:42:15,660 INFO L226 Difference]: Without dead ends: 25 [2018-11-12 20:42:15,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:42:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-12 20:42:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-12 20:42:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:42:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-12 20:42:15,666 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-11-12 20:42:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:15,666 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-12 20:42:15,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:42:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-12 20:42:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:42:15,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:15,668 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:15,668 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:15,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash -732759811, now seen corresponding path program 4 times [2018-11-12 20:42:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:15,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:15,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:15,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,865 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-12 20:42:15,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:15,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:15,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:15,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:15,866 INFO L192 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-12 20:42:15,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:15,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:15,913 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-12 20:42:15,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:16,057 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-12 20:42:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:42:16,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:16,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:42:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:42:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:42:16,078 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-12 20:42:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:16,125 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-12 20:42:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:42:16,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:42:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:16,128 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:42:16,128 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:42:16,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:42:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:42:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-12 20:42:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:42:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-12 20:42:16,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-11-12 20:42:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:16,135 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-12 20:42:16,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:42:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-12 20:42:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:42:16,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:16,137 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:16,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1984471427, now seen corresponding path program 5 times [2018-11-12 20:42:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:16,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:16,323 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-12 20:42:16,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:16,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:16,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:16,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:16,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:16,324 INFO L192 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-12 20:42:16,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:16,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:16,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:42:16,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:16,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:16,389 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-12 20:42:16,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:16,730 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-12 20:42:16,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:16,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-12 20:42:16,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:16,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:42:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:42:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:42:16,760 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2018-11-12 20:42:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:16,818 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-12 20:42:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:42:16,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-12 20:42:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:16,820 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:42:16,820 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:42:16,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:42:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-12 20:42:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:42:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-12 20:42:16,826 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-12 20:42:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:16,826 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-12 20:42:16,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:42:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-12 20:42:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:42:16,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:16,828 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:16,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:16,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1475807485, now seen corresponding path program 6 times [2018-11-12 20:42:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:16,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:16,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:16,984 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-12 20:42:16,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:16,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:16,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:16,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:16,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:16,986 INFO L192 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-12 20:42:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:16,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:17,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:17,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:17,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:17,041 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-12 20:42:17,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:17,369 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-12 20:42:17,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-12 20:42:17,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:17,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:42:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:42:17,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:42:17,393 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 11 states. [2018-11-12 20:42:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:17,471 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:42:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:42:17,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-12 20:42:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:17,474 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:42:17,474 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:42:17,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:42:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-12 20:42:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:42:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-12 20:42:17,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-12 20:42:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:17,480 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-12 20:42:17,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:42:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-12 20:42:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:42:17,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:17,482 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:17,482 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:17,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1160163715, now seen corresponding path program 7 times [2018-11-12 20:42:17,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:17,771 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-12 20:42:17,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:17,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:17,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:17,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:17,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:17,772 INFO L192 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-12 20:42:17,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:17,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:17,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:17,815 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-12 20:42:17,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:18,117 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-12 20:42:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:42:18,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:18,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:42:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:42:18,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:42:18,139 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 12 states. [2018-11-12 20:42:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:18,298 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-12 20:42:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:42:18,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-12 20:42:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:18,300 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:42:18,300 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:42:18,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:42:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-12 20:42:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:42:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-12 20:42:18,306 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-12 20:42:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:18,306 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-12 20:42:18,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:42:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-12 20:42:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:42:18,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:18,308 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:18,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:18,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -196142851, now seen corresponding path program 8 times [2018-11-12 20:42:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:18,476 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-12 20:42:18,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:18,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:18,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:18,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:18,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:18,478 INFO L192 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-12 20:42:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:18,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:18,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:42:18,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:18,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:18,551 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-12 20:42:18,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:18,797 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-12 20:42:18,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:18,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-12 20:42:18,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:18,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:42:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:42:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:18,820 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-11-12 20:42:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:18,888 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:42:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:42:18,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-12 20:42:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:18,889 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:42:18,889 INFO L226 Difference]: Without dead ends: 40 [2018-11-12 20:42:18,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:42:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-12 20:42:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-12 20:42:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:42:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-12 20:42:18,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-12 20:42:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:18,896 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-12 20:42:18,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:42:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-12 20:42:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-12 20:42:18,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:18,897 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:18,897 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:18,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1496891779, now seen corresponding path program 9 times [2018-11-12 20:42:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:19,151 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-12 20:42:19,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:19,152 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:19,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:19,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,152 INFO L192 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-12 20:42:19,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:19,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:19,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:19,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:19,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:19,249 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-12 20:42:19,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:19,620 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-12 20:42:19,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:19,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:42:19,641 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:19,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:42:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:42:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:42:19,643 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2018-11-12 20:42:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:19,699 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-12 20:42:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:42:19,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-12 20:42:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:19,701 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:42:19,702 INFO L226 Difference]: Without dead ends: 43 [2018-11-12 20:42:19,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:42:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-12 20:42:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-12 20:42:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:42:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-12 20:42:19,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-12 20:42:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:19,709 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-12 20:42:19,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:42:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-12 20:42:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:42:19,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:19,712 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:19,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:19,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1381705981, now seen corresponding path program 10 times [2018-11-12 20:42:19,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:19,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:19,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,098 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-12 20:42:20,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:20,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:20,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:20,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:20,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:20,099 INFO L192 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-12 20:42:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:20,192 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-12 20:42:20,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:20,547 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-12 20:42:20,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:20,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-12 20:42:20,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:20,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:42:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:42:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:42:20,570 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 15 states. [2018-11-12 20:42:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:20,616 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:42:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:42:20,616 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-12 20:42:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:20,617 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:42:20,617 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:42:20,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:42:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:42:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-12 20:42:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:42:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-12 20:42:20,623 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-12 20:42:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:20,624 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-12 20:42:20,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:42:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-12 20:42:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:42:20,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,625 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,625 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash 75574909, now seen corresponding path program 11 times [2018-11-12 20:42:20,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,885 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-12 20:42:20,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:20,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:20,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:20,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:20,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:20,886 INFO L192 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-12 20:42:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:20,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:20,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:42:20,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:20,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:20,980 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-12 20:42:20,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:21,262 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-12 20:42:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:42:21,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:42:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:42:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:42:21,284 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2018-11-12 20:42:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:21,390 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-12 20:42:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:42:21,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-12 20:42:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:21,392 INFO L225 Difference]: With dead ends: 54 [2018-11-12 20:42:21,392 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:42:21,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:42:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:42:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-12 20:42:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:42:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-12 20:42:21,402 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-12 20:42:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:21,403 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-12 20:42:21,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:42:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-12 20:42:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:42:21,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:21,407 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:21,408 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:21,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1528510717, now seen corresponding path program 12 times [2018-11-12 20:42:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:21,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,682 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-12 20:42:21,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:21,683 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:21,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:21,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,683 INFO L192 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-12 20:42:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:21,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:21,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:21,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:21,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:21,923 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-12 20:42:21,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:22,513 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-12 20:42:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-12 20:42:22,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:42:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:42:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:42:22,534 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2018-11-12 20:42:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:22,591 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-12 20:42:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:42:22,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-12 20:42:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:22,596 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:42:22,596 INFO L226 Difference]: Without dead ends: 52 [2018-11-12 20:42:22,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:42:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-12 20:42:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-12 20:42:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-12 20:42:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-12 20:42:22,601 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-12 20:42:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:22,602 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-12 20:42:22,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:42:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-12 20:42:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-12 20:42:22,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:22,603 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:22,603 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:22,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1258757757, now seen corresponding path program 13 times [2018-11-12 20:42:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:23,002 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-12 20:42:23,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:23,002 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:23,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:23,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,003 INFO L192 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-12 20:42:23,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:23,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:23,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:23,063 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-12 20:42:23,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:23,407 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-12 20:42:23,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:23,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-12 20:42:23,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:23,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:42:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:42:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:42:23,429 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 18 states. [2018-11-12 20:42:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:23,513 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-12 20:42:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:42:23,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-11-12 20:42:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:23,514 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:42:23,514 INFO L226 Difference]: Without dead ends: 55 [2018-11-12 20:42:23,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:42:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-12 20:42:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-12 20:42:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:42:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-12 20:42:23,519 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-12 20:42:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:23,519 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-12 20:42:23,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:42:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-12 20:42:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:42:23,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:23,521 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:23,521 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:23,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash 932137213, now seen corresponding path program 14 times [2018-11-12 20:42:23,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:23,768 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-12 20:42:23,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:23,769 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:23,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:23,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,769 INFO L192 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-12 20:42:23,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:23,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:23,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:42:23,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:23,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:23,849 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-12 20:42:23,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:24,672 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-12 20:42:24,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:24,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-12 20:42:24,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:24,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:42:24,693 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 19 states. [2018-11-12 20:42:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:24,815 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-12 20:42:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:42:24,816 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-11-12 20:42:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:24,816 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:42:24,816 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:42:24,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:42:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:42:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-12 20:42:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:42:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-12 20:42:24,829 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-12 20:42:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:24,829 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-12 20:42:24,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-12 20:42:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-12 20:42:24,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:24,833 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:24,833 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:24,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1319563651, now seen corresponding path program 15 times [2018-11-12 20:42:24,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:24,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:24,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:25,042 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-12 20:42:25,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:25,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:25,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:25,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:25,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:25,042 INFO L192 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-12 20:42:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:25,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:25,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:25,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:25,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:25,148 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-12 20:42:25,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:26,101 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-12 20:42:26,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:26,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-12 20:42:26,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:26,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:42:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:42:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:26,123 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 20 states. [2018-11-12 20:42:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:26,231 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-12 20:42:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:42:26,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-11-12 20:42:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:26,233 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:42:26,233 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:42:26,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:42:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:42:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-12 20:42:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:42:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-12 20:42:26,240 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-12 20:42:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:26,240 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-12 20:42:26,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:42:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-12 20:42:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:42:26,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:26,242 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:26,242 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:26,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1354193149, now seen corresponding path program 16 times [2018-11-12 20:42:26,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:26,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:26,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:26,895 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-12 20:42:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:26,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:26,896 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:26,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:26,896 INFO L192 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-12 20:42:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:26,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:26,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:27,189 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-12 20:42:27,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:28,441 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-12 20:42:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-12 20:42:28,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:28,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:42:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:42:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:28,463 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 21 states. [2018-11-12 20:42:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:28,526 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-12 20:42:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:42:28,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-11-12 20:42:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:28,527 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:42:28,528 INFO L226 Difference]: Without dead ends: 64 [2018-11-12 20:42:28,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-12 20:42:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-12 20:42:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-12 20:42:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-12 20:42:28,535 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-12 20:42:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:28,535 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-12 20:42:28,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:42:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-12 20:42:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-12 20:42:28,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:28,536 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:28,536 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:28,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 779550333, now seen corresponding path program 17 times [2018-11-12 20:42:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:28,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:29,326 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-12 20:42:29,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:29,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:29,326 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:29,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:29,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:29,326 INFO L192 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-12 20:42:29,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:29,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:29,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:42:29,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:29,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:29,402 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-12 20:42:29,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:29,867 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-12 20:42:29,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:29,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-12 20:42:29,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:29,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:42:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:42:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:42:29,889 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 22 states. [2018-11-12 20:42:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:29,949 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-12 20:42:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:42:29,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-11-12 20:42:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:29,951 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:42:29,951 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:42:29,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:42:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:42:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-12 20:42:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:42:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-12 20:42:29,957 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-12 20:42:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:29,957 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-12 20:42:29,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:42:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-12 20:42:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:42:29,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:29,959 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:29,959 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:29,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1335060733, now seen corresponding path program 18 times [2018-11-12 20:42:29,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:29,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:29,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:30,526 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-12 20:42:30,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:30,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:30,527 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:30,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:30,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:30,527 INFO L192 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-12 20:42:30,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:30,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:30,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:30,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:30,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:30,594 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-12 20:42:30,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:31,053 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-12 20:42:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-12 20:42:31,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:31,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:42:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:42:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:31,076 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 23 states. [2018-11-12 20:42:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:31,142 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-12 20:42:31,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:42:31,142 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-11-12 20:42:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:31,143 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:42:31,143 INFO L226 Difference]: Without dead ends: 70 [2018-11-12 20:42:31,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:42:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-12 20:42:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-12 20:42:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:42:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-12 20:42:31,149 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-12 20:42:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:31,149 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-12 20:42:31,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:42:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-12 20:42:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-12 20:42:31,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:31,150 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:31,150 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:31,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2036395645, now seen corresponding path program 19 times [2018-11-12 20:42:31,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:31,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:31,421 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-12 20:42:31,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:31,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:31,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:31,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:31,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:31,421 INFO L192 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-12 20:42:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:31,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:31,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:31,521 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-12 20:42:31,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:32,100 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-12 20:42:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-12 20:42:32,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:32,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:42:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:42:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:32,123 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 24 states. [2018-11-12 20:42:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:32,197 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-12 20:42:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:42:32,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2018-11-12 20:42:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:32,199 INFO L225 Difference]: With dead ends: 78 [2018-11-12 20:42:32,199 INFO L226 Difference]: Without dead ends: 73 [2018-11-12 20:42:32,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:42:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-12 20:42:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-12 20:42:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:42:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-12 20:42:32,204 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-12 20:42:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:32,204 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-12 20:42:32,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:42:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-12 20:42:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:42:32,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:32,205 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:32,205 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:32,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 488863997, now seen corresponding path program 20 times [2018-11-12 20:42:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,636 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-12 20:42:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:32,637 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:32,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,637 INFO L192 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-12 20:42:32,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:32,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:32,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:42:32,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:32,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:32,725 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-12 20:42:32,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:33,672 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-12 20:42:33,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:33,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-12 20:42:33,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:33,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:42:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:42:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:42:33,695 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 25 states. [2018-11-12 20:42:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:33,917 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-12 20:42:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:42:33,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-11-12 20:42:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:33,922 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:42:33,922 INFO L226 Difference]: Without dead ends: 76 [2018-11-12 20:42:33,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:42:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-12 20:42:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-12 20:42:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:42:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-12 20:42:33,926 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-12 20:42:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:33,927 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-12 20:42:33,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:42:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-12 20:42:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:42:33,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:33,928 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:33,928 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 152493693, now seen corresponding path program 21 times [2018-11-12 20:42:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:33,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:33,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:34,424 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-12 20:42:34,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:34,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:34,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:34,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:34,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:34,425 INFO L192 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-12 20:42:34,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:34,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:34,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:34,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:34,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:34,516 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-12 20:42:34,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:35,147 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-12 20:42:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-12 20:42:35,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:35,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:42:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:42:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:42:35,168 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 26 states. [2018-11-12 20:42:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:35,239 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-12 20:42:35,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:42:35,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 74 [2018-11-12 20:42:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:35,240 INFO L225 Difference]: With dead ends: 84 [2018-11-12 20:42:35,241 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:42:35,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:42:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:42:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-12 20:42:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:42:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-12 20:42:35,245 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-12 20:42:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:35,246 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-12 20:42:35,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:42:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-12 20:42:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:42:35,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:35,247 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:35,247 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:35,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash -496531203, now seen corresponding path program 22 times [2018-11-12 20:42:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:35,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:35,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:35,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:35,864 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-12 20:42:35,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:35,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:35,865 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:35,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:35,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:35,865 INFO L192 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-12 20:42:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:35,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:35,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:35,952 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-12 20:42:35,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:36,613 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-12 20:42:36,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-12 20:42:36,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:36,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:42:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:42:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:42:36,635 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 27 states. [2018-11-12 20:42:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:36,693 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-12 20:42:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:42:36,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2018-11-12 20:42:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:36,695 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:42:36,695 INFO L226 Difference]: Without dead ends: 82 [2018-11-12 20:42:36,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:42:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-12 20:42:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-12 20:42:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-12 20:42:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-12 20:42:36,699 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-12 20:42:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:36,700 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-12 20:42:36,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:42:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-12 20:42:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-12 20:42:36,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:36,701 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:36,701 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:36,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 345558653, now seen corresponding path program 23 times [2018-11-12 20:42:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,060 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-12 20:42:37,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:37,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:37,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:37,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,061 INFO L192 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-12 20:42:37,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:37,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:37,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:42:37,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:37,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:37,202 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-12 20:42:37,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:37,919 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-12 20:42:37,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:37,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-12 20:42:37,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:37,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:42:37,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:42:37,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:42:37,940 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 28 states. [2018-11-12 20:42:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:38,022 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-12 20:42:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:42:38,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2018-11-12 20:42:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:38,023 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:42:38,023 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:42:38,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:42:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:42:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-12 20:42:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:42:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-12 20:42:38,027 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-12 20:42:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:38,028 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-12 20:42:38,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:42:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-12 20:42:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:42:38,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:38,029 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:38,029 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:38,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash 140482813, now seen corresponding path program 24 times [2018-11-12 20:42:38,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:38,663 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-12 20:42:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:38,663 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:38,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,663 INFO L192 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-12 20:42:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:38,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:38,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:38,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:38,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:38,799 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-12 20:42:38,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:39,559 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-12 20:42:39,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:39,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-12 20:42:39,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:39,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:42:39,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:42:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:42:39,582 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 29 states. [2018-11-12 20:42:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:39,670 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-12 20:42:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:42:39,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 83 [2018-11-12 20:42:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:39,672 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:42:39,672 INFO L226 Difference]: Without dead ends: 88 [2018-11-12 20:42:39,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:42:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-12 20:42:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-12 20:42:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:42:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-12 20:42:39,676 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-12 20:42:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:39,676 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-12 20:42:39,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:42:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-12 20:42:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:42:39,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:39,677 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:39,677 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:39,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1830371715, now seen corresponding path program 25 times [2018-11-12 20:42:39,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:39,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:39,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:40,073 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-12 20:42:40,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:40,074 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:40,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:40,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,074 INFO L192 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-12 20:42:40,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:40,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:40,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:40,185 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-12 20:42:40,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:41,021 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-12 20:42:41,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-12 20:42:41,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:41,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:42:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:42:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 20:42:41,044 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 30 states. [2018-11-12 20:42:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:41,134 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-12 20:42:41,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:42:41,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-11-12 20:42:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:41,136 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:42:41,136 INFO L226 Difference]: Without dead ends: 91 [2018-11-12 20:42:41,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:42:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-12 20:42:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-12 20:42:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-12 20:42:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-12 20:42:41,141 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-12 20:42:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:41,142 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-12 20:42:41,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:42:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-12 20:42:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:42:41,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:41,143 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:41,143 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:41,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 940288253, now seen corresponding path program 26 times [2018-11-12 20:42:41,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:41,898 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-12 20:42:41,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:41,898 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:41,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:41,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,899 INFO L192 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-12 20:42:41,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:41,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:41,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:42:41,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:41,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:42,015 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-12 20:42:42,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:44,552 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-12 20:42:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:44,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-12 20:42:44,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:44,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:42:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:42:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2018-11-12 20:42:44,576 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 31 states. [2018-11-12 20:42:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:44,643 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-12 20:42:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:42:44,644 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-11-12 20:42:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:44,645 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:42:44,645 INFO L226 Difference]: Without dead ends: 94 [2018-11-12 20:42:44,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:42:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-12 20:42:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-12 20:42:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:42:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-12 20:42:44,649 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-11-12 20:42:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:44,650 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-12 20:42:44,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:42:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-12 20:42:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-12 20:42:44,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:44,650 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:44,650 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:44,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash 989900413, now seen corresponding path program 27 times [2018-11-12 20:42:44,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:44,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:44,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:44,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:44,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:45,250 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-12 20:42:45,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:45,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:45,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:45,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:45,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:45,250 INFO L192 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-12 20:42:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:45,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:45,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:45,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:45,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:45,356 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-12 20:42:45,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:46,493 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-12 20:42:46,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:46,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2018-11-12 20:42:46,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:46,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:42:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:42:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2018-11-12 20:42:46,514 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 32 states. [2018-11-12 20:42:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:46,628 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-12 20:42:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:42:46,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 92 [2018-11-12 20:42:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:46,629 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:42:46,630 INFO L226 Difference]: Without dead ends: 97 [2018-11-12 20:42:46,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:42:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-12 20:42:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-12 20:42:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-12 20:42:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-12 20:42:46,637 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-11-12 20:42:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:46,637 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-12 20:42:46,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:42:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-12 20:42:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-12 20:42:46,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:46,638 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:46,638 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:46,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1517009149, now seen corresponding path program 28 times [2018-11-12 20:42:46,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:46,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:46,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:46,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:47,433 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-12 20:42:47,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:47,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:47,433 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:47,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:47,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:47,434 INFO L192 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-12 20:42:47,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:47,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:47,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:47,538 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-12 20:42:47,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:48,884 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-12 20:42:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-12 20:42:48,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:48,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:42:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:42:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:42:48,905 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 33 states. [2018-11-12 20:42:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:49,012 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-12 20:42:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:42:49,022 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-11-12 20:42:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:49,023 INFO L225 Difference]: With dead ends: 105 [2018-11-12 20:42:49,023 INFO L226 Difference]: Without dead ends: 100 [2018-11-12 20:42:49,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:42:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-12 20:42:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-12 20:42:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:42:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-12 20:42:49,027 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-11-12 20:42:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:49,027 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-12 20:42:49,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:42:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-12 20:42:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-12 20:42:49,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:49,028 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:49,029 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:49,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2082038147, now seen corresponding path program 29 times [2018-11-12 20:42:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:49,523 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-12 20:42:49,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:49,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:49,524 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:49,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:49,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:49,524 INFO L192 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-12 20:42:49,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:49,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:49,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:42:49,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:49,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:49,640 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-12 20:42:49,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:50,679 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-12 20:42:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:50,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-12 20:42:50,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:50,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:42:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:42:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:42:50,700 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 34 states. [2018-11-12 20:42:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:50,797 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-12 20:42:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:42:50,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 98 [2018-11-12 20:42:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:50,798 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:42:50,798 INFO L226 Difference]: Without dead ends: 103 [2018-11-12 20:42:50,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:42:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-12 20:42:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-12 20:42:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-12 20:42:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-11-12 20:42:50,802 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-11-12 20:42:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:50,802 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-11-12 20:42:50,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:42:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-12 20:42:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 20:42:50,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:50,803 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:50,803 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:50,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1736455939, now seen corresponding path program 30 times [2018-11-12 20:42:50,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:50,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:50,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:51,318 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-12 20:42:51,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:51,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:51,318 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:51,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:51,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:51,318 INFO L192 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-12 20:42:51,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:51,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:51,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:51,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:51,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:51,412 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-12 20:42:51,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:52,772 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-12 20:42:52,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2018-11-12 20:42:52,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:42:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:42:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:42:52,793 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 35 states. [2018-11-12 20:42:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:52,925 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-12 20:42:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:42:52,925 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 101 [2018-11-12 20:42:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:52,926 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:42:52,926 INFO L226 Difference]: Without dead ends: 106 [2018-11-12 20:42:52,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:42:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-12 20:42:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-12 20:42:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-12 20:42:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-12 20:42:52,931 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-11-12 20:42:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:52,931 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-12 20:42:52,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:42:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-12 20:42:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 20:42:52,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:52,932 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:52,932 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:52,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1533505923, now seen corresponding path program 31 times [2018-11-12 20:42:52,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:52,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:52,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:53,881 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-12 20:42:53,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:53,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:53,881 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:53,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:53,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:53,882 INFO L192 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-12 20:42:53,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:53,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:53,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:54,021 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-12 20:42:54,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:55,180 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-12 20:42:55,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:55,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-12 20:42:55,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:55,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:42:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:42:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 20:42:55,202 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 36 states. [2018-11-12 20:42:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:55,342 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-12 20:42:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:42:55,343 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 104 [2018-11-12 20:42:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:55,344 INFO L225 Difference]: With dead ends: 114 [2018-11-12 20:42:55,344 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:42:55,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:42:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:42:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-11-12 20:42:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-12 20:42:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-11-12 20:42:55,349 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-11-12 20:42:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:55,350 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-11-12 20:42:55,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:42:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-12 20:42:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 20:42:55,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:55,351 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:55,351 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:55,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1531435261, now seen corresponding path program 32 times [2018-11-12 20:42:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:55,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:56,049 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-12 20:42:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:56,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:56,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:56,049 INFO L192 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-12 20:42:56,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:56,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:56,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:42:56,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:56,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:56,257 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-12 20:42:56,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:57,511 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-12 20:42:57,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:57,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-12 20:42:57,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:57,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:42:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:42:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:42:57,534 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 37 states. [2018-11-12 20:42:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:57,602 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-12 20:42:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:42:57,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 107 [2018-11-12 20:42:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:57,603 INFO L225 Difference]: With dead ends: 117 [2018-11-12 20:42:57,604 INFO L226 Difference]: Without dead ends: 112 [2018-11-12 20:42:57,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:42:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-12 20:42:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-11-12 20:42:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-12 20:42:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-12 20:42:57,608 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-11-12 20:42:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:57,609 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-12 20:42:57,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:42:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-12 20:42:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-12 20:42:57,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:57,610 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:57,610 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:57,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1810465155, now seen corresponding path program 33 times [2018-11-12 20:42:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:57,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:59,128 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-12 20:42:59,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:59,128 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:59,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:59,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,128 INFO L192 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-12 20:42:59,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:59,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:59,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:59,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:59,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:59,233 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-12 20:42:59,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:00,561 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-12 20:43:00,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:00,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-12 20:43:00,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:00,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:43:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:43:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-11-12 20:43:00,582 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 38 states. [2018-11-12 20:43:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:00,664 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-12 20:43:00,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:43:00,665 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2018-11-12 20:43:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:00,665 INFO L225 Difference]: With dead ends: 120 [2018-11-12 20:43:00,665 INFO L226 Difference]: Without dead ends: 115 [2018-11-12 20:43:00,666 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:43:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-12 20:43:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-12 20:43:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-12 20:43:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-11-12 20:43:00,670 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-11-12 20:43:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:00,670 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-11-12 20:43:00,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:43:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-12 20:43:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 20:43:00,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:00,671 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:00,671 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:00,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1271130365, now seen corresponding path program 34 times [2018-11-12 20:43:00,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:00,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:00,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:00,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:01,925 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-12 20:43:01,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:01,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:01,925 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:01,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:01,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:01,926 INFO L192 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-12 20:43:01,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:01,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:01,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:02,032 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-12 20:43:02,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:03,549 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-12 20:43:03,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:03,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-12 20:43:03,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:03,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:43:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:43:03,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:43:03,571 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 39 states. [2018-11-12 20:43:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:03,901 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-12 20:43:03,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:43:03,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 113 [2018-11-12 20:43:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:03,902 INFO L225 Difference]: With dead ends: 123 [2018-11-12 20:43:03,902 INFO L226 Difference]: Without dead ends: 118 [2018-11-12 20:43:03,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:43:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-12 20:43:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-12 20:43:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-12 20:43:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-11-12 20:43:03,906 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-11-12 20:43:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-11-12 20:43:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:43:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-11-12 20:43:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-12 20:43:03,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:03,908 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:03,908 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:03,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash 157314685, now seen corresponding path program 35 times [2018-11-12 20:43:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:03,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:04,675 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-12 20:43:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:04,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:04,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:04,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:04,676 INFO L192 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-12 20:43:04,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:04,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:04,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:43:04,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:04,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:05,243 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-12 20:43:05,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:07,701 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-12 20:43:07,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:07,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-12 20:43:07,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:07,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:43:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:43:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=3295, Unknown=0, NotChecked=0, Total=6006 [2018-11-12 20:43:07,723 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 40 states. [2018-11-12 20:43:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:07,816 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-12 20:43:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:43:07,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 116 [2018-11-12 20:43:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:07,818 INFO L225 Difference]: With dead ends: 126 [2018-11-12 20:43:07,818 INFO L226 Difference]: Without dead ends: 121 [2018-11-12 20:43:07,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2717, Invalid=3445, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:43:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-12 20:43:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-12 20:43:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:43:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-11-12 20:43:07,822 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-11-12 20:43:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:07,823 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-11-12 20:43:07,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:43:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-11-12 20:43:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:43:07,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:07,824 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:07,824 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:07,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1391720701, now seen corresponding path program 36 times [2018-11-12 20:43:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:07,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:08,526 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-12 20:43:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:08,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:08,527 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:08,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:08,527 INFO L192 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-12 20:43:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:08,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:08,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:08,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:08,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:08,859 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-12 20:43:08,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:10,899 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-12 20:43:10,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:10,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2018-11-12 20:43:10,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:10,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:43:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:43:10,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2860, Invalid=3460, Unknown=0, NotChecked=0, Total=6320 [2018-11-12 20:43:10,922 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 41 states. [2018-11-12 20:43:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:11,014 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-12 20:43:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:43:11,015 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 119 [2018-11-12 20:43:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:11,016 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:43:11,016 INFO L226 Difference]: Without dead ends: 124 [2018-11-12 20:43:11,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2866, Invalid=3614, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:43:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-12 20:43:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-11-12 20:43:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-12 20:43:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-12 20:43:11,020 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-11-12 20:43:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:11,021 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-12 20:43:11,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:43:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-12 20:43:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-12 20:43:11,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:11,022 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:11,022 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:11,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2071355005, now seen corresponding path program 37 times [2018-11-12 20:43:11,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:11,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:11,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:11,810 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-12 20:43:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:11,810 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:11,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,811 INFO L192 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-12 20:43:11,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:11,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:11,971 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-12 20:43:11,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:13,667 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-12 20:43:13,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:13,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-12 20:43:13,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:13,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:43:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:43:13,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:43:13,690 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 42 states. [2018-11-12 20:43:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:13,809 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-12 20:43:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:43:13,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 122 [2018-11-12 20:43:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:13,818 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:43:13,818 INFO L226 Difference]: Without dead ends: 127 [2018-11-12 20:43:13,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:43:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-12 20:43:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-11-12 20:43:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-12 20:43:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-11-12 20:43:13,823 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-11-12 20:43:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:13,823 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-11-12 20:43:13,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:43:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-11-12 20:43:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 20:43:13,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:13,825 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:13,825 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1713895171, now seen corresponding path program 38 times [2018-11-12 20:43:13,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:13,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:13,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:15,418 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-12 20:43:15,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:15,418 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:15,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:15,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,418 INFO L192 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-12 20:43:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:15,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:15,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:43:15,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:15,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:15,639 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-12 20:43:15,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:17,293 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-12 20:43:17,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-12 20:43:17,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:17,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:43:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:43:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3170, Invalid=3802, Unknown=0, NotChecked=0, Total=6972 [2018-11-12 20:43:17,315 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 43 states. [2018-11-12 20:43:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:17,528 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-12 20:43:17,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:43:17,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2018-11-12 20:43:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:17,529 INFO L225 Difference]: With dead ends: 135 [2018-11-12 20:43:17,529 INFO L226 Difference]: Without dead ends: 130 [2018-11-12 20:43:17,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3176, Invalid=3964, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:43:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-12 20:43:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-12 20:43:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-12 20:43:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-11-12 20:43:17,537 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-11-12 20:43:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:17,537 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-11-12 20:43:17,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:43:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-11-12 20:43:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 20:43:17,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:17,538 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:17,539 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:17,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash 559435389, now seen corresponding path program 39 times [2018-11-12 20:43:17,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:17,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:17,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:17,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:17,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:18,389 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-12 20:43:18,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:18,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:18,389 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:18,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:18,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:18,389 INFO L192 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-12 20:43:18,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:18,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:18,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:18,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:18,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:18,543 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-12 20:43:18,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:20,583 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-12 20:43:20,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:20,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2018-11-12 20:43:20,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:20,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:43:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:43:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3331, Invalid=3979, Unknown=0, NotChecked=0, Total=7310 [2018-11-12 20:43:20,614 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 44 states. [2018-11-12 20:43:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:20,830 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-12 20:43:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:43:20,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 128 [2018-11-12 20:43:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:20,832 INFO L225 Difference]: With dead ends: 138 [2018-11-12 20:43:20,832 INFO L226 Difference]: Without dead ends: 133 [2018-11-12 20:43:20,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3337, Invalid=4145, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:43:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-12 20:43:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-11-12 20:43:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-12 20:43:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-11-12 20:43:20,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-11-12 20:43:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:20,838 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-11-12 20:43:20,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:43:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-11-12 20:43:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-12 20:43:20,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:20,839 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:20,839 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:20,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1989142275, now seen corresponding path program 40 times [2018-11-12 20:43:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:20,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:21,676 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-12 20:43:21,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:21,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:21,677 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:21,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:21,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:21,677 INFO L192 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-12 20:43:21,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:21,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:21,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:21,814 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-12 20:43:21,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:23,806 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-12 20:43:23,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:23,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-12 20:43:23,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:23,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:43:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:43:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3496, Invalid=4160, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:43:23,836 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 45 states. [2018-11-12 20:43:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:23,991 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-12 20:43:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:43:23,991 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2018-11-12 20:43:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:23,992 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:43:23,992 INFO L226 Difference]: Without dead ends: 136 [2018-11-12 20:43:23,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3502, Invalid=4330, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:43:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-12 20:43:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-12 20:43:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-12 20:43:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-12 20:43:23,997 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-11-12 20:43:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:23,998 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-12 20:43:23,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:43:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-12 20:43:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 20:43:23,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:23,999 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:23,999 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:23,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash -234471811, now seen corresponding path program 41 times [2018-11-12 20:43:23,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:24,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:24,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:25,262 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-12 20:43:25,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:25,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:25,262 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:25,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:25,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:25,263 INFO L192 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-12 20:43:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:25,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:25,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-12 20:43:25,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:25,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:25,506 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-12 20:43:25,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:27,609 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-12 20:43:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:27,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-12 20:43:27,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:27,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:43:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:43:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3665, Invalid=4345, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:43:27,632 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 46 states. [2018-11-12 20:43:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:27,993 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-12 20:43:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:43:27,993 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 134 [2018-11-12 20:43:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:27,994 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:43:27,994 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:43:27,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3671, Invalid=4519, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:43:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:43:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-11-12 20:43:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-12 20:43:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-11-12 20:43:27,999 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-11-12 20:43:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:27,999 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-11-12 20:43:27,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:43:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-11-12 20:43:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-12 20:43:28,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:28,000 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:28,000 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:28,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -893638403, now seen corresponding path program 42 times [2018-11-12 20:43:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:28,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:29,622 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-12 20:43:29,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:29,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:29,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:29,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,623 INFO L192 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-12 20:43:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:29,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:29,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:29,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:29,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:29,908 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-12 20:43:29,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:32,002 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-12 20:43:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:32,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2018-11-12 20:43:32,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:32,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:43:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:43:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3838, Invalid=4534, Unknown=0, NotChecked=0, Total=8372 [2018-11-12 20:43:32,023 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 47 states. [2018-11-12 20:43:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:32,156 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-12 20:43:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:43:32,157 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 137 [2018-11-12 20:43:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:32,158 INFO L225 Difference]: With dead ends: 147 [2018-11-12 20:43:32,158 INFO L226 Difference]: Without dead ends: 142 [2018-11-12 20:43:32,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3844, Invalid=4712, Unknown=0, NotChecked=0, Total=8556 [2018-11-12 20:43:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-12 20:43:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-11-12 20:43:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-12 20:43:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-11-12 20:43:32,162 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-11-12 20:43:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:32,162 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-11-12 20:43:32,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:43:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-11-12 20:43:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 20:43:32,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:32,163 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:32,164 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:32,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1535103363, now seen corresponding path program 43 times [2018-11-12 20:43:32,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:32,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:32,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:32,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:32,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:33,074 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-12 20:43:33,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:33,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:33,075 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:33,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:33,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:33,075 INFO L192 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-12 20:43:33,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:33,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:33,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:33,216 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-12 20:43:33,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:35,656 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-12 20:43:35,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:35,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-12 20:43:35,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:35,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:43:35,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:43:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2018-11-12 20:43:35,677 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 48 states. [2018-11-12 20:43:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:35,769 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-12 20:43:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-12 20:43:35,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 140 [2018-11-12 20:43:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:35,771 INFO L225 Difference]: With dead ends: 150 [2018-11-12 20:43:35,771 INFO L226 Difference]: Without dead ends: 145 [2018-11-12 20:43:35,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2018-11-12 20:43:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-12 20:43:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-11-12 20:43:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-12 20:43:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-11-12 20:43:35,776 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-11-12 20:43:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:35,777 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-11-12 20:43:35,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:43:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-11-12 20:43:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:43:35,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:35,778 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:35,778 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:35,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1186740477, now seen corresponding path program 44 times [2018-11-12 20:43:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:35,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:35,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:35,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:35,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:36,728 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-12 20:43:36,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:36,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:36,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:36,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:36,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:36,729 INFO L192 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-12 20:43:36,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:36,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:36,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-12 20:43:36,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:36,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:36,876 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-12 20:43:36,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:39,152 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-12 20:43:39,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:39,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-12 20:43:39,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:43:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:43:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:43:39,174 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 49 states. [2018-11-12 20:43:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:39,271 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-12 20:43:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:43:39,271 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2018-11-12 20:43:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:39,273 INFO L225 Difference]: With dead ends: 153 [2018-11-12 20:43:39,273 INFO L226 Difference]: Without dead ends: 148 [2018-11-12 20:43:39,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-12 20:43:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-12 20:43:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-12 20:43:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-12 20:43:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-12 20:43:39,278 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-11-12 20:43:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:39,279 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-12 20:43:39,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:43:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-12 20:43:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-12 20:43:39,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:39,280 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:39,280 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:39,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1345970563, now seen corresponding path program 45 times [2018-11-12 20:43:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:39,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:39,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:40,592 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-12 20:43:40,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:40,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:40,592 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:40,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:40,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:40,592 INFO L192 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-12 20:43:40,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:40,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:40,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:40,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:40,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:40,741 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-12 20:43:40,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:43,075 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-12 20:43:43,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:43,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2018-11-12 20:43:43,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:43,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-12 20:43:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-12 20:43:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2018-11-12 20:43:43,097 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 50 states. [2018-11-12 20:43:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:43,188 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-11-12 20:43:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-12 20:43:43,189 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 146 [2018-11-12 20:43:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:43,190 INFO L225 Difference]: With dead ends: 156 [2018-11-12 20:43:43,190 INFO L226 Difference]: Without dead ends: 151 [2018-11-12 20:43:43,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2018-11-12 20:43:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-12 20:43:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-11-12 20:43:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-12 20:43:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-11-12 20:43:43,195 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-11-12 20:43:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:43,195 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-11-12 20:43:43,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-12 20:43:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-11-12 20:43:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 20:43:43,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:43,196 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:43,196 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:43,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 644892925, now seen corresponding path program 46 times [2018-11-12 20:43:43,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:43,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:43,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:44,232 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-12 20:43:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:44,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:44,233 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:44,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:44,233 INFO L192 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-12 20:43:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:44,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:44,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:44,423 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-12 20:43:44,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:47,406 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-12 20:43:47,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:47,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-12 20:43:47,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:47,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:43:47,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:43:47,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4570, Invalid=5330, Unknown=0, NotChecked=0, Total=9900 [2018-11-12 20:43:47,428 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 51 states. [2018-11-12 20:43:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:47,560 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-12 20:43:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:43:47,560 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 149 [2018-11-12 20:43:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:47,561 INFO L225 Difference]: With dead ends: 159 [2018-11-12 20:43:47,561 INFO L226 Difference]: Without dead ends: 154 [2018-11-12 20:43:47,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4576, Invalid=5524, Unknown=0, NotChecked=0, Total=10100 [2018-11-12 20:43:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-12 20:43:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-12 20:43:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-12 20:43:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-11-12 20:43:47,566 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-11-12 20:43:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:47,567 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-11-12 20:43:47,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:43:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-11-12 20:43:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-12 20:43:47,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:47,568 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:47,568 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:47,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1255673469, now seen corresponding path program 47 times [2018-11-12 20:43:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:47,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:47,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:47,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:48,917 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-12 20:43:48,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:48,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:48,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:48,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:48,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:48,918 INFO L192 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-12 20:43:48,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:48,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:49,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-12 20:43:49,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:49,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:49,122 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-12 20:43:49,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:51,950 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-12 20:43:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-12 20:43:51,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:51,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:43:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:43:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4763, Invalid=5539, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:51,972 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 52 states. [2018-11-12 20:43:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:52,110 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-11-12 20:43:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:43:52,111 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 152 [2018-11-12 20:43:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:52,112 INFO L225 Difference]: With dead ends: 162 [2018-11-12 20:43:52,112 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:43:52,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4769, Invalid=5737, Unknown=0, NotChecked=0, Total=10506 [2018-11-12 20:43:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:43:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-12 20:43:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-12 20:43:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-11-12 20:43:52,118 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-11-12 20:43:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:52,119 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-11-12 20:43:52,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:43:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-11-12 20:43:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 20:43:52,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:52,120 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:52,120 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:52,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -757573379, now seen corresponding path program 48 times [2018-11-12 20:43:52,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:52,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:52,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:53,239 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-12 20:43:53,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:53,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:53,239 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:53,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:53,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:53,240 INFO L192 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-12 20:43:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:53,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:53,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:53,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:53,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:53,538 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-12 20:43:53,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:56,440 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-12 20:43:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:56,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2018-11-12 20:43:56,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:56,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:43:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:43:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=5752, Unknown=0, NotChecked=0, Total=10712 [2018-11-12 20:43:56,462 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 53 states. [2018-11-12 20:43:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:56,627 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-11-12 20:43:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:43:56,627 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 155 [2018-11-12 20:43:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:56,628 INFO L225 Difference]: With dead ends: 165 [2018-11-12 20:43:56,628 INFO L226 Difference]: Without dead ends: 160 [2018-11-12 20:43:56,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4966, Invalid=5954, Unknown=0, NotChecked=0, Total=10920 [2018-11-12 20:43:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-12 20:43:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-11-12 20:43:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-12 20:43:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-12 20:43:56,633 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-11-12 20:43:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:56,633 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-12 20:43:56,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:43:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-12 20:43:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 20:43:56,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:56,634 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:56,634 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:56,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1823866493, now seen corresponding path program 49 times [2018-11-12 20:43:56,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:56,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:56,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:56,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:56,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:58,047 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-12 20:43:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:58,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:58,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:58,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:58,048 INFO L192 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-12 20:43:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:58,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:58,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:58,246 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-12 20:43:58,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:01,174 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-12 20:44:01,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-12 20:44:01,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:01,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:44:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:44:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5161, Invalid=5969, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:44:01,196 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 54 states. [2018-11-12 20:44:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:01,348 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-11-12 20:44:01,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:44:01,349 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 158 [2018-11-12 20:44:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:01,350 INFO L225 Difference]: With dead ends: 168 [2018-11-12 20:44:01,350 INFO L226 Difference]: Without dead ends: 163 [2018-11-12 20:44:01,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5167, Invalid=6175, Unknown=0, NotChecked=0, Total=11342 [2018-11-12 20:44:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-12 20:44:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-11-12 20:44:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-12 20:44:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-11-12 20:44:01,355 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-11-12 20:44:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:01,356 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-11-12 20:44:01,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:44:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-11-12 20:44:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-12 20:44:01,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:01,357 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:01,357 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:01,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash -185308931, now seen corresponding path program 50 times [2018-11-12 20:44:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:01,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:01,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:02,468 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-12 20:44:02,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:02,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:02,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:02,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:02,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:02,469 INFO L192 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-12 20:44:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:02,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:02,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-12 20:44:02,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:02,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:02,692 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-12 20:44:02,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:05,865 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-12 20:44:05,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-12 20:44:05,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:05,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-12 20:44:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-12 20:44:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5366, Invalid=6190, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:44:05,889 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 55 states. [2018-11-12 20:44:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:05,997 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-12 20:44:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:44:05,997 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 161 [2018-11-12 20:44:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:05,998 INFO L225 Difference]: With dead ends: 171 [2018-11-12 20:44:05,998 INFO L226 Difference]: Without dead ends: 166 [2018-11-12 20:44:05,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5372, Invalid=6400, Unknown=0, NotChecked=0, Total=11772 [2018-11-12 20:44:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-12 20:44:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-11-12 20:44:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-12 20:44:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-11-12 20:44:06,003 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-11-12 20:44:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:06,003 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-11-12 20:44:06,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-12 20:44:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-11-12 20:44:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 20:44:06,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:06,005 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:06,005 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -866128259, now seen corresponding path program 51 times [2018-11-12 20:44:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:06,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:06,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:07,391 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-12 20:44:07,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:07,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:07,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:07,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:07,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:07,392 INFO L192 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-12 20:44:07,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:07,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:07,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:07,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:07,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:07,581 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-12 20:44:07,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:10,948 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-12 20:44:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2018-11-12 20:44:10,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:10,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-12 20:44:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-12 20:44:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2018-11-12 20:44:10,970 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 56 states. [2018-11-12 20:44:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:11,167 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-11-12 20:44:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-12 20:44:11,167 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 164 [2018-11-12 20:44:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:11,169 INFO L225 Difference]: With dead ends: 174 [2018-11-12 20:44:11,169 INFO L226 Difference]: Without dead ends: 169 [2018-11-12 20:44:11,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2018-11-12 20:44:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-12 20:44:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-11-12 20:44:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-12 20:44:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-11-12 20:44:11,174 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-11-12 20:44:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:11,174 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-11-12 20:44:11,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-12 20:44:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-11-12 20:44:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-12 20:44:11,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:11,175 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:11,175 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:11,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1975810301, now seen corresponding path program 52 times [2018-11-12 20:44:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:11,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:11,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:12,725 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-12 20:44:12,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:12,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:12,725 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:12,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:12,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:12,726 INFO L192 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-12 20:44:12,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:12,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:12,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:12,918 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-12 20:44:12,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:16,381 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-12 20:44:16,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:16,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-12 20:44:16,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:16,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-12 20:44:16,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-12 20:44:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5788, Invalid=6644, Unknown=0, NotChecked=0, Total=12432 [2018-11-12 20:44:16,403 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 57 states. [2018-11-12 20:44:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:16,520 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-11-12 20:44:16,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-12 20:44:16,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 167 [2018-11-12 20:44:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:16,522 INFO L225 Difference]: With dead ends: 177 [2018-11-12 20:44:16,522 INFO L226 Difference]: Without dead ends: 172 [2018-11-12 20:44:16,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5794, Invalid=6862, Unknown=0, NotChecked=0, Total=12656 [2018-11-12 20:44:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-12 20:44:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-11-12 20:44:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-12 20:44:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-12 20:44:16,526 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-11-12 20:44:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:16,526 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-12 20:44:16,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-12 20:44:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-12 20:44:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 20:44:16,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:16,527 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:16,528 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:16,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash -522854787, now seen corresponding path program 53 times [2018-11-12 20:44:16,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:16,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:16,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:17,690 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-12 20:44:17,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:17,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:17,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:17,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,691 INFO L192 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-12 20:44:17,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:17,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:17,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-12 20:44:17,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:17,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:18,409 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-12 20:44:18,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:21,899 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-12 20:44:21,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:21,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-12 20:44:21,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:21,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-12 20:44:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-12 20:44:21,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=6877, Unknown=0, NotChecked=0, Total=12882 [2018-11-12 20:44:21,922 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 58 states. [2018-11-12 20:44:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:22,095 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-11-12 20:44:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-12 20:44:22,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 170 [2018-11-12 20:44:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:22,096 INFO L225 Difference]: With dead ends: 180 [2018-11-12 20:44:22,097 INFO L226 Difference]: Without dead ends: 175 [2018-11-12 20:44:22,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6011, Invalid=7099, Unknown=0, NotChecked=0, Total=13110 [2018-11-12 20:44:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-12 20:44:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-11-12 20:44:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-12 20:44:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-11-12 20:44:22,101 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-11-12 20:44:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:22,101 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-11-12 20:44:22,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-12 20:44:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-11-12 20:44:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-12 20:44:22,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:22,102 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:22,102 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:22,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2118682877, now seen corresponding path program 54 times [2018-11-12 20:44:22,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:22,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:22,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:22,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:23,454 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-12 20:44:23,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:23,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:23,454 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:23,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:23,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:23,455 INFO L192 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-12 20:44:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:23,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:23,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:23,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:23,643 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-12 20:44:23,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:27,323 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-12 20:44:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:27,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-12 20:44:27,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:27,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-12 20:44:27,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-12 20:44:27,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2018-11-12 20:44:27,347 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 59 states. [2018-11-12 20:44:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:27,480 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-12 20:44:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:44:27,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 173 [2018-11-12 20:44:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:27,482 INFO L225 Difference]: With dead ends: 183 [2018-11-12 20:44:27,482 INFO L226 Difference]: Without dead ends: 178 [2018-11-12 20:44:27,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2018-11-12 20:44:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-12 20:44:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-11-12 20:44:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-12 20:44:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-11-12 20:44:27,487 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-11-12 20:44:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:27,487 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-11-12 20:44:27,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-12 20:44:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-11-12 20:44:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-12 20:44:27,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:27,488 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:27,488 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:27,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash -518533507, now seen corresponding path program 55 times [2018-11-12 20:44:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:27,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:27,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:28,819 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-12 20:44:28,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:28,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:28,820 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:28,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:28,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:28,820 INFO L192 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-12 20:44:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:28,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:28,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:29,015 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-12 20:44:29,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:32,665 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-12 20:44:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:32,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-12 20:44:32,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:32,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-12 20:44:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-12 20:44:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2018-11-12 20:44:32,687 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 60 states. [2018-11-12 20:44:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:32,882 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-11-12 20:44:32,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-12 20:44:32,883 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 176 [2018-11-12 20:44:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:32,884 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:44:32,884 INFO L226 Difference]: Without dead ends: 181 [2018-11-12 20:44:32,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2018-11-12 20:44:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-12 20:44:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-12 20:44:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-12 20:44:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-11-12 20:44:32,889 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-11-12 20:44:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-11-12 20:44:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-12 20:44:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-11-12 20:44:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-12 20:44:32,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:32,891 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:32,891 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:32,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2004916477, now seen corresponding path program 56 times [2018-11-12 20:44:32,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:34,212 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-12 20:44:34,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:34,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:34,212 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:34,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:34,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:34,212 INFO L192 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-12 20:44:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:34,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:34,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-11-12 20:44:34,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:34,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:34,520 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-12 20:44:34,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:38,378 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-12 20:44:38,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:38,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2018-11-12 20:44:38,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:38,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-12 20:44:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-12 20:44:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6680, Invalid=7600, Unknown=0, NotChecked=0, Total=14280 [2018-11-12 20:44:38,401 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 61 states. [2018-11-12 20:44:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:38,613 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-11-12 20:44:38,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-12 20:44:38,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 179 [2018-11-12 20:44:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:38,615 INFO L225 Difference]: With dead ends: 189 [2018-11-12 20:44:38,615 INFO L226 Difference]: Without dead ends: 184 [2018-11-12 20:44:38,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6686, Invalid=7834, Unknown=0, NotChecked=0, Total=14520 [2018-11-12 20:44:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-12 20:44:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-12 20:44:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-12 20:44:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-12 20:44:38,621 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-11-12 20:44:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:38,621 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-12 20:44:38,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-12 20:44:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-12 20:44:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-12 20:44:38,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:38,622 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:38,623 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:38,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1004159363, now seen corresponding path program 57 times [2018-11-12 20:44:38,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:38,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:38,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:38,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:38,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:40,155 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-12 20:44:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:40,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:40,155 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:40,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:40,155 INFO L192 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-12 20:44:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:40,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:40,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:40,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:40,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:40,339 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-12 20:44:40,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:44,260 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-12 20:44:44,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:44,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2018-11-12 20:44:44,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:44,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-12 20:44:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-12 20:44:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=7849, Unknown=0, NotChecked=0, Total=14762 [2018-11-12 20:44:44,284 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 62 states. [2018-11-12 20:44:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:44,429 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-11-12 20:44:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-12 20:44:44,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 182 [2018-11-12 20:44:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:44,432 INFO L225 Difference]: With dead ends: 192 [2018-11-12 20:44:44,432 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:44:44,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6919, Invalid=8087, Unknown=0, NotChecked=0, Total=15006 [2018-11-12 20:44:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:44:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-12 20:44:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-12 20:44:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-11-12 20:44:44,437 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-11-12 20:44:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:44,437 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-11-12 20:44:44,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-12 20:44:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-11-12 20:44:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-12 20:44:44,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:44,438 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:44,439 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:44,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 174893309, now seen corresponding path program 58 times [2018-11-12 20:44:44,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:44,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:44,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:44,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:44,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:45,936 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-12 20:44:45,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:45,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:45,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:45,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:45,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:45,937 INFO L192 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-12 20:44:45,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:45,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:46,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:46,132 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-12 20:44:46,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:50,040 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-12 20:44:50,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:50,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2018-11-12 20:44:50,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:50,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-12 20:44:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-12 20:44:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2018-11-12 20:44:50,062 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 63 states. [2018-11-12 20:44:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:50,249 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-12 20:44:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:44:50,249 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 185 [2018-11-12 20:44:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:50,250 INFO L225 Difference]: With dead ends: 195 [2018-11-12 20:44:50,251 INFO L226 Difference]: Without dead ends: 190 [2018-11-12 20:44:50,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2018-11-12 20:44:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-12 20:44:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-11-12 20:44:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-12 20:44:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-11-12 20:44:50,256 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-11-12 20:44:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:50,256 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-11-12 20:44:50,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-12 20:44:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-11-12 20:44:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-12 20:44:50,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:50,258 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:50,258 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:50,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1090498173, now seen corresponding path program 59 times [2018-11-12 20:44:50,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:52,013 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-12 20:44:52,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:52,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:52,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:52,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:52,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:52,014 INFO L192 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-12 20:44:52,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:52,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:52,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-11-12 20:44:52,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:52,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:52,241 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-12 20:44:52,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:56,081 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-12 20:44:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:56,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2018-11-12 20:44:56,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:56,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-12 20:44:56,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-12 20:44:56,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2018-11-12 20:44:56,103 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 64 states. [2018-11-12 20:44:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:56,281 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-11-12 20:44:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-12 20:44:56,282 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 188 [2018-11-12 20:44:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:56,283 INFO L225 Difference]: With dead ends: 198 [2018-11-12 20:44:56,283 INFO L226 Difference]: Without dead ends: 193 [2018-11-12 20:44:56,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2018-11-12 20:44:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-12 20:44:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-11-12 20:44:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-12 20:44:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-11-12 20:44:56,287 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-11-12 20:44:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:56,287 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-11-12 20:44:56,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-12 20:44:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-11-12 20:44:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-12 20:44:56,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:56,288 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:56,288 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:56,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash 537704701, now seen corresponding path program 60 times [2018-11-12 20:44:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:56,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:58,014 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-12 20:44:58,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:58,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:58,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:58,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:58,015 INFO L192 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-12 20:44:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:58,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:58,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:58,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:58,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:58,202 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-12 20:44:58,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:02,544 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-12 20:45:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:02,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2018-11-12 20:45:02,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-12 20:45:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-12 20:45:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7636, Invalid=8620, Unknown=0, NotChecked=0, Total=16256 [2018-11-12 20:45:02,585 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 65 states. [2018-11-12 20:45:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:03,286 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-11-12 20:45:03,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:45:03,286 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 191 [2018-11-12 20:45:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:03,287 INFO L225 Difference]: With dead ends: 201 [2018-11-12 20:45:03,287 INFO L226 Difference]: Without dead ends: 196 [2018-11-12 20:45:03,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 319 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7642, Invalid=8870, Unknown=0, NotChecked=0, Total=16512 [2018-11-12 20:45:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-12 20:45:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-11-12 20:45:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-12 20:45:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-12 20:45:03,292 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-11-12 20:45:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-12 20:45:03,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-12 20:45:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-12 20:45:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 20:45:03,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:03,293 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:03,293 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:03,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash -828006787, now seen corresponding path program 61 times [2018-11-12 20:45:03,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:03,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:03,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:04,809 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-12 20:45:04,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:04,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:04,810 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:04,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:04,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:04,810 INFO L192 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-12 20:45:04,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:04,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:04,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:04,996 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-12 20:45:04,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:09,467 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-12 20:45:09,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:09,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2018-11-12 20:45:09,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-12 20:45:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-12 20:45:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2018-11-12 20:45:09,490 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 66 states. [2018-11-12 20:45:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:09,714 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-11-12 20:45:09,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-12 20:45:09,714 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 194 [2018-11-12 20:45:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:09,715 INFO L225 Difference]: With dead ends: 204 [2018-11-12 20:45:09,715 INFO L226 Difference]: Without dead ends: 199 [2018-11-12 20:45:09,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2018-11-12 20:45:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-12 20:45:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-12 20:45:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-12 20:45:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-11-12 20:45:09,720 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-11-12 20:45:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:09,721 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-11-12 20:45:09,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-12 20:45:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-11-12 20:45:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-12 20:45:09,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:09,722 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:09,722 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:09,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash -513750787, now seen corresponding path program 62 times [2018-11-12 20:45:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:09,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:09,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:11,327 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-12 20:45:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:11,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:11,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:11,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:11,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:11,328 INFO L192 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-12 20:45:11,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:11,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:11,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-11-12 20:45:11,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:11,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:11,584 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-12 20:45:11,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:16,118 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-12 20:45:16,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:16,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2018-11-12 20:45:16,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:16,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-12 20:45:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-12 20:45:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2018-11-12 20:45:16,142 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 67 states. [2018-11-12 20:45:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:16,372 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-12 20:45:16,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-12 20:45:16,373 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 197 [2018-11-12 20:45:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:16,374 INFO L225 Difference]: With dead ends: 207 [2018-11-12 20:45:16,374 INFO L226 Difference]: Without dead ends: 202 [2018-11-12 20:45:16,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2018-11-12 20:45:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-12 20:45:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-11-12 20:45:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-12 20:45:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-11-12 20:45:16,380 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-11-12 20:45:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:16,380 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-11-12 20:45:16,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-12 20:45:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-11-12 20:45:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-12 20:45:16,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:16,382 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:16,382 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:16,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:16,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1541960067, now seen corresponding path program 63 times [2018-11-12 20:45:16,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:16,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:16,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:18,349 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-12 20:45:18,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:18,350 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:18,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:18,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,350 INFO L192 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-12 20:45:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:18,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:18,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:18,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:18,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:18,581 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-12 20:45:18,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:23,377 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-12 20:45:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2018-11-12 20:45:23,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:23,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-12 20:45:23,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-12 20:45:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8395, Invalid=9427, Unknown=0, NotChecked=0, Total=17822 [2018-11-12 20:45:23,399 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 68 states. [2018-11-12 20:45:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:23,606 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-11-12 20:45:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-12 20:45:23,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 200 [2018-11-12 20:45:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:23,608 INFO L225 Difference]: With dead ends: 210 [2018-11-12 20:45:23,608 INFO L226 Difference]: Without dead ends: 205 [2018-11-12 20:45:23,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8401, Invalid=9689, Unknown=0, NotChecked=0, Total=18090 [2018-11-12 20:45:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-12 20:45:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-11-12 20:45:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-12 20:45:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-11-12 20:45:23,612 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-11-12 20:45:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:23,612 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-11-12 20:45:23,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-12 20:45:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-11-12 20:45:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-12 20:45:23,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:23,614 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:23,614 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:23,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1217865475, now seen corresponding path program 64 times [2018-11-12 20:45:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:23,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:23,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:23,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:25,249 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-12 20:45:25,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:25,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:25,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:25,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:25,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:25,250 INFO L192 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-12 20:45:25,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:25,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:25,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:25,460 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-12 20:45:25,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:30,419 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-12 20:45:30,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2018-11-12 20:45:30,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:30,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:45:30,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:45:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2018-11-12 20:45:30,442 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 69 states. [2018-11-12 20:45:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:30,635 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-11-12 20:45:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:45:30,635 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 203 [2018-11-12 20:45:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:30,637 INFO L225 Difference]: With dead ends: 213 [2018-11-12 20:45:30,637 INFO L226 Difference]: Without dead ends: 208 [2018-11-12 20:45:30,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2018-11-12 20:45:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-12 20:45:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-11-12 20:45:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-12 20:45:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-11-12 20:45:30,642 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-11-12 20:45:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:30,642 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-11-12 20:45:30,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:45:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-11-12 20:45:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-12 20:45:30,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:30,643 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:30,643 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:30,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1202356611, now seen corresponding path program 65 times [2018-11-12 20:45:30,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:30,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:30,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:32,692 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-12 20:45:32,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:32,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:32,693 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:32,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:32,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:32,693 INFO L192 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-12 20:45:32,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:32,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:32,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-11-12 20:45:32,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:32,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:32,995 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-12 20:45:32,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:38,055 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-12 20:45:38,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:38,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2018-11-12 20:45:38,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:38,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-12 20:45:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-12 20:45:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2018-11-12 20:45:38,079 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 70 states. [2018-11-12 20:45:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:38,310 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-11-12 20:45:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-12 20:45:38,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 206 [2018-11-12 20:45:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:38,312 INFO L225 Difference]: With dead ends: 216 [2018-11-12 20:45:38,312 INFO L226 Difference]: Without dead ends: 211 [2018-11-12 20:45:38,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2018-11-12 20:45:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-12 20:45:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-11-12 20:45:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-12 20:45:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-11-12 20:45:38,316 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-11-12 20:45:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:38,316 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-11-12 20:45:38,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-12 20:45:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-11-12 20:45:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 20:45:38,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:38,318 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:38,318 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:38,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:38,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1260710141, now seen corresponding path program 66 times [2018-11-12 20:45:38,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:38,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:38,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:40,057 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-12 20:45:40,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:40,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:40,058 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:40,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:40,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:40,058 INFO L192 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-12 20:45:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:40,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:40,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:40,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:40,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:40,274 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-12 20:45:40,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:45,359 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-12 20:45:45,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:45,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-12 20:45:45,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:45,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-12 20:45:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-12 20:45:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2018-11-12 20:45:45,381 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 71 states. [2018-11-12 20:45:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:45,584 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-11-12 20:45:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:45:45,584 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 209 [2018-11-12 20:45:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:45,586 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:45:45,586 INFO L226 Difference]: Without dead ends: 214 [2018-11-12 20:45:45,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2018-11-12 20:45:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-12 20:45:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-11-12 20:45:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-12 20:45:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-11-12 20:45:45,591 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-11-12 20:45:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:45,592 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-11-12 20:45:45,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-12 20:45:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-11-12 20:45:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-12 20:45:45,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:45,593 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:45,593 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:45,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1033933187, now seen corresponding path program 67 times [2018-11-12 20:45:45,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:45,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:45,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:45,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:47,481 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-12 20:45:47,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:47,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:47,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:47,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:47,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:47,482 INFO L192 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-12 20:45:47,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:47,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:47,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:47,755 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-12 20:45:47,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:53,117 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-12 20:45:53,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:53,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-12 20:45:53,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:53,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-12 20:45:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-12 20:45:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2018-11-12 20:45:53,140 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 72 states. [2018-11-12 20:45:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:53,386 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-11-12 20:45:53,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-12 20:45:53,386 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 212 [2018-11-12 20:45:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:53,388 INFO L225 Difference]: With dead ends: 222 [2018-11-12 20:45:53,388 INFO L226 Difference]: Without dead ends: 217 [2018-11-12 20:45:53,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2018-11-12 20:45:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-12 20:45:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-11-12 20:45:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-12 20:45:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-11-12 20:45:53,394 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-11-12 20:45:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:53,394 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-11-12 20:45:53,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-12 20:45:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-11-12 20:45:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-12 20:45:53,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:53,396 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:53,396 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:53,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2053834499, now seen corresponding path program 68 times [2018-11-12 20:45:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:53,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:55,265 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-12 20:45:55,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:55,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:55,266 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:55,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:55,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:55,266 INFO L192 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-12 20:45:55,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:55,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:55,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-11-12 20:45:55,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:55,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:55,552 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-12 20:45:55,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:01,058 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-12 20:46:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 144 [2018-11-12 20:46:01,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:01,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-12 20:46:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-12 20:46:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2018-11-12 20:46:01,082 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 73 states. [2018-11-12 20:46:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:01,307 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-11-12 20:46:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-12 20:46:01,307 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 215 [2018-11-12 20:46:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:01,308 INFO L225 Difference]: With dead ends: 225 [2018-11-12 20:46:01,308 INFO L226 Difference]: Without dead ends: 220 [2018-11-12 20:46:01,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2018-11-12 20:46:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-12 20:46:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-11-12 20:46:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-12 20:46:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-11-12 20:46:01,313 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-11-12 20:46:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:01,313 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-11-12 20:46:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-12 20:46:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-11-12 20:46:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-12 20:46:01,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:01,314 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:01,315 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:01,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 959798909, now seen corresponding path program 69 times [2018-11-12 20:46:01,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:01,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:01,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:46:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:01,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:03,511 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-12 20:46:03,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:03,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:03,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:03,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:03,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:03,512 INFO L192 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-12 20:46:03,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:46:03,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:46:03,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:46:03,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:03,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:03,745 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-12 20:46:03,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-12 20:46:07,525 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 20:46:07,725 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:46:07,726 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:46:07,732 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:46:07,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:46:07 BoogieIcfgContainer [2018-11-12 20:46:07,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:46:07,734 INFO L168 Benchmark]: Toolchain (without parser) took 235391.50 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 787.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.0 MB). Peak memory consumption was 670.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:46:07,735 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:46:07,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.35 ms. Allocated memory is still 1.6 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-12 20:46:07,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.43 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:46:07,736 INFO L168 Benchmark]: Boogie Preprocessor took 21.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:46:07,737 INFO L168 Benchmark]: RCFGBuilder took 313.76 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:46:07,737 INFO L168 Benchmark]: TraceAbstraction took 234741.05 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 48.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.3 MB). Peak memory consumption was 711.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:46:07,740 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.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.35 ms. Allocated memory is still 1.6 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.43 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 313.76 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234741.05 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 48.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.3 MB). Peak memory consumption was 711.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 219 with TraceHistMax 70,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 129 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 234.6s OverallTime, 71 OverallIterations, 70 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 780 SDtfs, 2482 SDslu, 19339 SDs, 0 SdLazy, 4603 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18260 GetRequests, 13029 SyntacticMatches, 69 SemanticMatches, 5162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18962 ImplicationChecksByTransitivity, 203.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 68 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 207.7s InterpolantComputationTime, 15593 NumberOfCodeBlocks, 15593 NumberOfCodeBlocksAsserted, 965 NumberOfCheckSat, 23173 ConstructedInterpolants, 0 QuantifiedInterpolants, 9789751 SizeOfPredicates, 137 NumberOfNonLiveVariables, 29852 ConjunctsInSsa, 2818 ConjunctsInUnsatCore, 206 InterpolantComputations, 2 PerfectInterpolantSequences, 0/485622 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown