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-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:44:10,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:44:10,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:44:10,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:44:10,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:44:10,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:44:10,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:44:10,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:44:10,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:44:10,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:44:10,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:44:10,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:44:10,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:44:10,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:44:10,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:44:10,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:44:10,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:44:10,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:44:10,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:44:10,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:44:10,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:44:10,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:44:10,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:44:10,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:44:10,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:44:10,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:44:10,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:44:10,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:44:10,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:44:10,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:44:10,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:44:10,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:44:10,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:44:10,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:44:10,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:44:10,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:44:10,588 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:44:10,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:44:10,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:44:10,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:44:10,617 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:44:10,617 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:44:10,617 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:44:10,617 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:44:10,618 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:44:10,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:44:10,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:44:10,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:44:10,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:44:10,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:44:10,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:44:10,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:44:10,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:44:10,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:44:10,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:44:10,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:44:10,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:44:10,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:10,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:44:10,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:44:10,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:44:10,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:44:10,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:44:10,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:44:10,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:44:10,626 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:44:10,626 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:44:10,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:44:10,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:44:10,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:44:10,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:44:10,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:44:10,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-12 20:44:10,765 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d879bff/5f9ffa50034342e49cd0785c4ff461db/FLAGb9528d4ab [2018-11-12 20:44:11,234 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:44:11,235 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-12 20:44:11,242 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d879bff/5f9ffa50034342e49cd0785c4ff461db/FLAGb9528d4ab [2018-11-12 20:44:11,256 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d879bff/5f9ffa50034342e49cd0785c4ff461db [2018-11-12 20:44:11,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:44:11,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:44:11,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:11,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:44:11,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:44:11,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470ab010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11, skipping insertion in model container [2018-11-12 20:44:11,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:44:11,312 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:44:11,503 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:11,507 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:44:11,529 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:11,548 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:44:11,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11 WrapperNode [2018-11-12 20:44:11,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:11,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:11,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:44:11,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:44:11,560 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:44:11" (1/1) ... [2018-11-12 20:44:11,569 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:44:11" (1/1) ... [2018-11-12 20:44:11,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:11,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:44:11,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:44:11,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:44:11,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (1/1) ... [2018-11-12 20:44:11,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:44:11,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:44:11,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:44:11,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:44:11,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (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:44:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:44:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:44:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-11-12 20:44:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-11-12 20:44:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:44:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:44:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:44:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:44:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:44:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:44:12,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:44:12,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:12 BoogieIcfgContainer [2018-11-12 20:44:12,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:44:12,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:44:12,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:44:12,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:44:12,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:44:11" (1/3) ... [2018-11-12 20:44:12,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:12, skipping insertion in model container [2018-11-12 20:44:12,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:11" (2/3) ... [2018-11-12 20:44:12,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:12, skipping insertion in model container [2018-11-12 20:44:12,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:12" (3/3) ... [2018-11-12 20:44:12,146 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-11-12 20:44:12,160 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:44:12,168 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:44:12,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:44:12,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:44:12,224 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:44:12,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:44:12,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:44:12,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:44:12,225 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:44:12,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:44:12,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:44:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-12 20:44:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:44:12,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:12,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:12,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:12,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-11-12 20:44:12,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:12,393 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:44:12,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:44:12,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:44:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:44:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:44:12,419 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-12 20:44:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:12,442 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-11-12 20:44:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:44:12,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-12 20:44:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:12,455 INFO L225 Difference]: With dead ends: 44 [2018-11-12 20:44:12,456 INFO L226 Difference]: Without dead ends: 25 [2018-11-12 20:44:12,460 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:44:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-12 20:44:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-12 20:44:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-12 20:44:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-12 20:44:12,506 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-11-12 20:44:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-12 20:44:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:44:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-12 20:44:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:44:12,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:12,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:12,509 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:12,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-11-12 20:44:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:12,598 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:44:12,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:12,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:44:12,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:12,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:12,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:12,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:12,601 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-12 20:44:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:12,700 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-12 20:44:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:12,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-12 20:44:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:12,702 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:44:12,702 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:44:12,703 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:44:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:44:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-12 20:44:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:44:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-12 20:44:12,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-11-12 20:44:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:12,711 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-12 20:44:12,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-12 20:44:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:44:12,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:12,713 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:12,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:12,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-11-12 20:44:12,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:12,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:12,768 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:44:12,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:12,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:12,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:44:12,772 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-12 20:44:12,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:12,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:13,023 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 20:44:13,025 INFO L272 AbstractInterpreter]: Visited 18 different actions 43 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 3. Performed 105 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-12 20:44:13,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:13,059 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 20:44:13,133 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 59.8% of their original sizes. [2018-11-12 20:44:13,134 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 20:44:13,290 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-12 20:44:13,290 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 20:44:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:44:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-12 20:44:13,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:13,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:44:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:44:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:44:13,295 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-12 20:44:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:13,679 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-12 20:44:13,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:44:13,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-12 20:44:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:13,682 INFO L225 Difference]: With dead ends: 58 [2018-11-12 20:44:13,682 INFO L226 Difference]: Without dead ends: 41 [2018-11-12 20:44:13,683 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:44:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-12 20:44:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-12 20:44:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:44:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-12 20:44:13,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-11-12 20:44:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:13,693 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-12 20:44:13,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:44:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-12 20:44:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:44:13,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:13,695 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:13,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:13,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-11-12 20:44:13,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:13,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:13,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:13,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:13,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:13,759 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:44:13,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:13,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:13,760 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:44:13,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-12 20:44:13,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:13,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:13,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:13,823 INFO L272 AbstractInterpreter]: Visited 23 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Performed 124 root evaluator evaluations with a maximum evaluation depth of 6. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-12 20:44:13,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:13,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:13,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:13,832 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:44:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:13,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:13,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:13,903 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:44:13,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:14,031 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:44:14,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:14,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:44:14,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:14,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:44:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:44:14,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:44:14,072 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 4 states. [2018-11-12 20:44:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:14,301 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-11-12 20:44:14,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:44:14,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-12 20:44:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:14,303 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:44:14,304 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:44:14,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:44:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:44:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-12 20:44:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:44:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-12 20:44:14,313 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2018-11-12 20:44:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:14,313 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-12 20:44:14,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:44:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-12 20:44:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:44:14,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:14,315 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:14,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:14,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032045, now seen corresponding path program 2 times [2018-11-12 20:44:14,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:14,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:14,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:14,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:14,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:14,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:14,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:14,477 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:14,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:44:14,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:14,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 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:44:14,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:14,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:14,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:14,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:14,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:14,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:15,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:44:15,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 8] total 18 [2018-11-12 20:44:15,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:15,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:44:15,466 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 9 states. [2018-11-12 20:44:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:15,687 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-12 20:44:15,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:44:15,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-12 20:44:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:15,690 INFO L225 Difference]: With dead ends: 62 [2018-11-12 20:44:15,690 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:44:15,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:44:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:44:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-12 20:44:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:44:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-11-12 20:44:15,703 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 28 [2018-11-12 20:44:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:15,703 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-12 20:44:15,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2018-11-12 20:44:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:44:15,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:15,705 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:15,705 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1809879087, now seen corresponding path program 1 times [2018-11-12 20:44:15,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:15,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:15,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:44:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:15,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:44:15,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:15,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:44:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:44:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:44:15,759 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 4 states. [2018-11-12 20:44:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:15,821 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-12 20:44:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:15,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-12 20:44:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:15,825 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:44:15,826 INFO L226 Difference]: Without dead ends: 72 [2018-11-12 20:44:15,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:44:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-12 20:44:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-12 20:44:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:44:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-12 20:44:15,841 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 28 [2018-11-12 20:44:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:15,842 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-12 20:44:15,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:44:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-12 20:44:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:44:15,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:15,843 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:15,843 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-11-12 20:44:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:15,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:15,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:15,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:15,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-12 20:44:15,916 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-12 20:44:15,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:15,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:15,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:15,980 INFO L272 AbstractInterpreter]: Visited 24 different actions 61 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 190 root evaluator evaluations with a maximum evaluation depth of 6. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-12 20:44:15,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:15,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:15,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:15,990 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:44:15,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:16,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:16,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:16,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:16,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:16,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-12 20:44:16,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:16,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:44:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:44:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:44:16,145 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2018-11-12 20:44:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:16,235 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2018-11-12 20:44:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:44:16,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-12 20:44:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:16,237 INFO L225 Difference]: With dead ends: 131 [2018-11-12 20:44:16,237 INFO L226 Difference]: Without dead ends: 92 [2018-11-12 20:44:16,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:44:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-12 20:44:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-11-12 20:44:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:44:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-12 20:44:16,249 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2018-11-12 20:44:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:16,249 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-12 20:44:16,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:44:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-12 20:44:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:44:16,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:16,251 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:16,251 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:16,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1153463970, now seen corresponding path program 2 times [2018-11-12 20:44:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:16,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:16,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:16,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:16,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:16,348 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:16,348 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:16,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:16,348 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:44:16,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:16,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:16,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:16,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:16,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:44:16,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:44:16,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:44:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 20 [2018-11-12 20:44:16,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:16,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:44:16,782 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 9 states. [2018-11-12 20:44:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:17,147 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-11-12 20:44:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:44:17,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-12 20:44:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:17,150 INFO L225 Difference]: With dead ends: 94 [2018-11-12 20:44:17,150 INFO L226 Difference]: Without dead ends: 92 [2018-11-12 20:44:17,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:44:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-12 20:44:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-11-12 20:44:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:44:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-12 20:44:17,161 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-11-12 20:44:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:17,161 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-12 20:44:17,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-12 20:44:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:44:17,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:17,163 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:17,163 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:17,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1155311012, now seen corresponding path program 1 times [2018-11-12 20:44:17,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:44:17,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:17,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:44:17,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:17,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:17,211 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 3 states. [2018-11-12 20:44:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:17,259 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-12 20:44:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:17,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-12 20:44:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:17,265 INFO L225 Difference]: With dead ends: 128 [2018-11-12 20:44:17,265 INFO L226 Difference]: Without dead ends: 90 [2018-11-12 20:44:17,266 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:44:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-12 20:44:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-11-12 20:44:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:44:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-12 20:44:17,285 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 32 [2018-11-12 20:44:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:17,286 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-12 20:44:17,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-12 20:44:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:44:17,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:17,287 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:17,288 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:17,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1098052710, now seen corresponding path program 1 times [2018-11-12 20:44:17,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:17,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:17,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:17,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-12 20:44:17,407 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-12 20:44:17,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:17,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:17,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:17,457 INFO L272 AbstractInterpreter]: Visited 24 different actions 54 times. Merged at 5 different actions 20 times. Widened at 1 different actions 1 times. Performed 157 root evaluator evaluations with a maximum evaluation depth of 6. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-12 20:44:17,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:17,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:17,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,465 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:44:17,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:17,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:17,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:17,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:17,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-12 20:44:17,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:17,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:44:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:44:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:17,677 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 6 states. [2018-11-12 20:44:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:17,763 INFO L93 Difference]: Finished difference Result 155 states and 196 transitions. [2018-11-12 20:44:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:44:17,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-12 20:44:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:17,766 INFO L225 Difference]: With dead ends: 155 [2018-11-12 20:44:17,766 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:44:17,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:44:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-11-12 20:44:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-12 20:44:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2018-11-12 20:44:17,777 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 32 [2018-11-12 20:44:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:17,777 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2018-11-12 20:44:17,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:44:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-12 20:44:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-12 20:44:17,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:17,779 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:17,779 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:17,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1098984993, now seen corresponding path program 2 times [2018-11-12 20:44:17,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:17,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:17,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:17,884 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,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:17,884 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:44:17,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:17,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:17,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:17,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:17,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:44:17,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:44:18,010 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:44:18,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-11-12 20:44:18,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:18,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:44:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:44:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:44:18,011 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 5 states. [2018-11-12 20:44:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:18,221 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2018-11-12 20:44:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:44:18,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-12 20:44:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:18,223 INFO L225 Difference]: With dead ends: 181 [2018-11-12 20:44:18,223 INFO L226 Difference]: Without dead ends: 135 [2018-11-12 20:44:18,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:44:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-12 20:44:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2018-11-12 20:44:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-12 20:44:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-11-12 20:44:18,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 36 [2018-11-12 20:44:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:18,243 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-11-12 20:44:18,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:44:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-12 20:44:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-12 20:44:18,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:18,245 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:18,246 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:18,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2113546820, now seen corresponding path program 1 times [2018-11-12 20:44:18,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:18,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:18,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-12 20:44:18,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:18,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:18,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-12 20:44:18,346 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-12 20:44:18,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:18,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:18,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:18,540 INFO L272 AbstractInterpreter]: Visited 26 different actions 101 times. Merged at 10 different actions 49 times. Widened at 2 different actions 4 times. Performed 298 root evaluator evaluations with a maximum evaluation depth of 6. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 8 variables. [2018-11-12 20:44:18,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:18,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:18,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:18,578 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:44:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:18,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:18,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 84 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-12 20:44:18,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 86 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-12 20:44:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:18,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-12 20:44:18,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:18,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:44:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:44:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:44:18,940 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 7 states. [2018-11-12 20:44:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:19,008 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-11-12 20:44:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:44:19,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-11-12 20:44:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:19,011 INFO L225 Difference]: With dead ends: 175 [2018-11-12 20:44:19,011 INFO L226 Difference]: Without dead ends: 122 [2018-11-12 20:44:19,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:44:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-12 20:44:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-12 20:44:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-12 20:44:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-11-12 20:44:19,022 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 63 [2018-11-12 20:44:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:19,022 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-11-12 20:44:19,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:44:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-11-12 20:44:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:44:19,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:19,024 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:19,025 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:19,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash -631971868, now seen corresponding path program 2 times [2018-11-12 20:44:19,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:19,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:19,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 126 proven. 50 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-12 20:44:19,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:19,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:19,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:19,125 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:19,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:19,125 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:44:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:19,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:19,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:19,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:19,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 20 proven. 127 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-12 20:44:19,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-12 20:44:19,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:19,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 22 [2018-11-12 20:44:19,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:44:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:44:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:44:19,879 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 16 states. [2018-11-12 20:44:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:20,859 INFO L93 Difference]: Finished difference Result 270 states and 341 transitions. [2018-11-12 20:44:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:44:20,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-11-12 20:44:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:20,863 INFO L225 Difference]: With dead ends: 270 [2018-11-12 20:44:20,863 INFO L226 Difference]: Without dead ends: 209 [2018-11-12 20:44:20,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:44:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-12 20:44:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2018-11-12 20:44:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-12 20:44:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2018-11-12 20:44:20,901 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 71 [2018-11-12 20:44:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:20,902 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2018-11-12 20:44:20,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:44:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2018-11-12 20:44:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:44:20,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:20,908 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 12, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:20,908 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:20,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1550893440, now seen corresponding path program 1 times [2018-11-12 20:44:20,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:20,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:20,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:20,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-12 20:44:21,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:21,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:21,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-12 20:44:21,074 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-12 20:44:21,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:21,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:21,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:21,313 INFO L272 AbstractInterpreter]: Visited 28 different actions 179 times. Merged at 12 different actions 73 times. Widened at 3 different actions 6 times. Performed 604 root evaluator evaluations with a maximum evaluation depth of 6. Performed 604 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 22 fixpoints after 5 different actions. Largest state had 8 variables. [2018-11-12 20:44:21,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:21,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:21,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:21,356 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:44:21,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:21,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:21,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 172 proven. 72 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:44:21,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 174 proven. 72 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-12 20:44:22,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:22,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-12 20:44:22,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:22,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:22,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:44:22,376 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand 9 states. [2018-11-12 20:44:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:22,581 INFO L93 Difference]: Finished difference Result 365 states and 456 transitions. [2018-11-12 20:44:22,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:44:22,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-12 20:44:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:22,586 INFO L225 Difference]: With dead ends: 365 [2018-11-12 20:44:22,586 INFO L226 Difference]: Without dead ends: 227 [2018-11-12 20:44:22,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:44:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-12 20:44:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2018-11-12 20:44:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-12 20:44:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2018-11-12 20:44:22,599 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 79 [2018-11-12 20:44:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:22,600 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2018-11-12 20:44:22,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2018-11-12 20:44:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-12 20:44:22,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:22,601 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 13, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:22,602 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:22,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -801878872, now seen corresponding path program 2 times [2018-11-12 20:44:22,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:22,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:22,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-12 20:44:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:22,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:22,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:22,748 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:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:22,748 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:44:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:22,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:22,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:22,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:22,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 28 proven. 231 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-12 20:44:23,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-11-12 20:44:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:23,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2018-11-12 20:44:23,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:23,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:44:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:44:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:44:23,274 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand 18 states. [2018-11-12 20:44:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:24,571 INFO L93 Difference]: Finished difference Result 409 states and 513 transitions. [2018-11-12 20:44:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:44:24,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-11-12 20:44:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:24,575 INFO L225 Difference]: With dead ends: 409 [2018-11-12 20:44:24,575 INFO L226 Difference]: Without dead ends: 263 [2018-11-12 20:44:24,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=505, Invalid=2045, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:44:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-12 20:44:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 247. [2018-11-12 20:44:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-12 20:44:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2018-11-12 20:44:24,592 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 87 [2018-11-12 20:44:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:24,592 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2018-11-12 20:44:24,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:44:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2018-11-12 20:44:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-12 20:44:24,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:24,594 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:24,595 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:24,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash 220500928, now seen corresponding path program 3 times [2018-11-12 20:44:24,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:24,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:24,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:24,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 294 proven. 128 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-12 20:44:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:24,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:24,777 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:24,777 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:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:24,777 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:44:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:24,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:24,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:24,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:24,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 110 proven. 443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:25,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 56 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:25,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:25,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19] total 36 [2018-11-12 20:44:25,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:25,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:44:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:44:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:44:25,404 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand 28 states. [2018-11-12 20:44:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:26,261 INFO L93 Difference]: Finished difference Result 572 states and 717 transitions. [2018-11-12 20:44:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:44:26,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 95 [2018-11-12 20:44:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:26,264 INFO L225 Difference]: With dead ends: 572 [2018-11-12 20:44:26,264 INFO L226 Difference]: Without dead ends: 402 [2018-11-12 20:44:26,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:44:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-12 20:44:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 373. [2018-11-12 20:44:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-12 20:44:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 445 transitions. [2018-11-12 20:44:26,286 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 445 transitions. Word has length 95 [2018-11-12 20:44:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:26,287 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 445 transitions. [2018-11-12 20:44:26,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:44:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 445 transitions. [2018-11-12 20:44:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 20:44:26,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:26,289 INFO L375 BasicCegarLoop]: trace histogram [20, 18, 18, 17, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:26,289 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:26,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:26,289 INFO L82 PathProgramCache]: Analyzing trace with hash -911767712, now seen corresponding path program 4 times [2018-11-12 20:44:26,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:26,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:26,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:26,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:26,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-12 20:44:26,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:26,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:26,433 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:26,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:44:26,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:26,433 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:44:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:26,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:26,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 364 proven. 162 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-11-12 20:44:26,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 366 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-12 20:44:26,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-12 20:44:26,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:26,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:44:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:44:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:44:26,857 INFO L87 Difference]: Start difference. First operand 373 states and 445 transitions. Second operand 12 states. [2018-11-12 20:44:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:27,166 INFO L93 Difference]: Finished difference Result 729 states and 879 transitions. [2018-11-12 20:44:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:44:27,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-11-12 20:44:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:27,170 INFO L225 Difference]: With dead ends: 729 [2018-11-12 20:44:27,170 INFO L226 Difference]: Without dead ends: 448 [2018-11-12 20:44:27,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:44:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-12 20:44:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 409. [2018-11-12 20:44:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-12 20:44:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 490 transitions. [2018-11-12 20:44:27,196 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 490 transitions. Word has length 103 [2018-11-12 20:44:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:27,197 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 490 transitions. [2018-11-12 20:44:27,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:44:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 490 transitions. [2018-11-12 20:44:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-12 20:44:27,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:27,199 INFO L375 BasicCegarLoop]: trace histogram [22, 20, 20, 19, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:27,199 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1728217600, now seen corresponding path program 5 times [2018-11-12 20:44:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:27,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 446 proven. 200 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-12 20:44:27,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:27,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:27,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:27,411 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:27,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:27,411 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:44:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:27,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:27,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:27,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:27,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 40 proven. 447 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-11-12 20:44:27,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-11-12 20:44:27,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2018-11-12 20:44:27,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:27,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:44:27,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:44:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:44:27,782 INFO L87 Difference]: Start difference. First operand 409 states and 490 transitions. Second operand 21 states. [2018-11-12 20:44:28,668 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-12 20:44:29,452 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-12 20:44:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:29,804 INFO L93 Difference]: Finished difference Result 968 states and 1173 transitions. [2018-11-12 20:44:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:44:29,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2018-11-12 20:44:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:29,808 INFO L225 Difference]: With dead ends: 968 [2018-11-12 20:44:29,808 INFO L226 Difference]: Without dead ends: 663 [2018-11-12 20:44:29,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=553, Invalid=1897, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:44:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-12 20:44:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 598. [2018-11-12 20:44:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-12 20:44:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 720 transitions. [2018-11-12 20:44:29,838 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 720 transitions. Word has length 111 [2018-11-12 20:44:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:29,838 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 720 transitions. [2018-11-12 20:44:29,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:44:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 720 transitions. [2018-11-12 20:44:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 20:44:29,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:29,841 INFO L375 BasicCegarLoop]: trace histogram [25, 23, 23, 21, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:29,841 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:29,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1425162325, now seen corresponding path program 1 times [2018-11-12 20:44:29,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:29,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:29,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-12 20:44:30,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:30,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:30,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-11-12 20:44:30,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-12 20:44:30,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:30,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:30,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:30,118 INFO L272 AbstractInterpreter]: Visited 27 different actions 112 times. Merged at 11 different actions 51 times. Widened at 2 different actions 4 times. Performed 351 root evaluator evaluations with a maximum evaluation depth of 6. Performed 351 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 4 different actions. Largest state had 8 variables. [2018-11-12 20:44:30,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:30,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:30,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:30,157 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:44:30,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:30,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:30,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 578 proven. 242 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-12 20:44:30,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 580 proven. 242 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-12 20:44:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-12 20:44:30,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:30,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:44:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:44:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:44:30,944 INFO L87 Difference]: Start difference. First operand 598 states and 720 transitions. Second operand 14 states. [2018-11-12 20:44:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:31,253 INFO L93 Difference]: Finished difference Result 1165 states and 1412 transitions. [2018-11-12 20:44:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:44:31,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2018-11-12 20:44:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:31,257 INFO L225 Difference]: With dead ends: 1165 [2018-11-12 20:44:31,257 INFO L226 Difference]: Without dead ends: 683 [2018-11-12 20:44:31,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:44:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-12 20:44:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 634. [2018-11-12 20:44:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-12 20:44:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 765 transitions. [2018-11-12 20:44:31,295 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 765 transitions. Word has length 123 [2018-11-12 20:44:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:31,295 INFO L480 AbstractCegarLoop]: Abstraction has 634 states and 765 transitions. [2018-11-12 20:44:31,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:44:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 765 transitions. [2018-11-12 20:44:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 20:44:31,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:31,298 INFO L375 BasicCegarLoop]: trace histogram [26, 24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:31,298 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:31,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1006237892, now seen corresponding path program 2 times [2018-11-12 20:44:31,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:31,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:31,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 630 proven. 288 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-12 20:44:31,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:31,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:31,628 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:31,629 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:31,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:31,629 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:44:31,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:31,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:31,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:31,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:31,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 48 proven. 631 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-11-12 20:44:31,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2018-11-12 20:44:32,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 30 [2018-11-12 20:44:32,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:32,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:44:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:44:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:44:32,015 INFO L87 Difference]: Start difference. First operand 634 states and 765 transitions. Second operand 23 states. [2018-11-12 20:44:34,196 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-12 20:44:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:34,762 INFO L93 Difference]: Finished difference Result 1265 states and 1538 transitions. [2018-11-12 20:44:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:44:34,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-11-12 20:44:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:34,766 INFO L225 Difference]: With dead ends: 1265 [2018-11-12 20:44:34,766 INFO L226 Difference]: Without dead ends: 759 [2018-11-12 20:44:34,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1040, Invalid=3930, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:44:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-12 20:44:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 623. [2018-11-12 20:44:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-12 20:44:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 749 transitions. [2018-11-12 20:44:34,808 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 749 transitions. Word has length 127 [2018-11-12 20:44:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:34,809 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 749 transitions. [2018-11-12 20:44:34,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:44:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 749 transitions. [2018-11-12 20:44:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-12 20:44:34,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:34,813 INFO L375 BasicCegarLoop]: trace histogram [42, 39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:34,813 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:34,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1712707552, now seen corresponding path program 3 times [2018-11-12 20:44:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:34,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:34,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-12 20:44:35,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:35,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:35,091 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:35,091 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:35,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:35,091 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:44:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:35,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:35,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:35,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:35,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1464 proven. 338 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-12 20:44:35,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 1468 proven. 338 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2018-11-12 20:44:35,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:35,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-12 20:44:35,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:35,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:44:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:44:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:44:35,758 INFO L87 Difference]: Start difference. First operand 623 states and 749 transitions. Second operand 16 states. [2018-11-12 20:44:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:35,973 INFO L93 Difference]: Finished difference Result 1235 states and 1493 transitions. [2018-11-12 20:44:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:44:35,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2018-11-12 20:44:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:35,978 INFO L225 Difference]: With dead ends: 1235 [2018-11-12 20:44:35,978 INFO L226 Difference]: Without dead ends: 752 [2018-11-12 20:44:35,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:44:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-12 20:44:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 549. [2018-11-12 20:44:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-11-12 20:44:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 664 transitions. [2018-11-12 20:44:36,011 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 664 transitions. Word has length 198 [2018-11-12 20:44:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:36,012 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 664 transitions. [2018-11-12 20:44:36,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:44:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 664 transitions. [2018-11-12 20:44:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-12 20:44:36,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:36,014 INFO L375 BasicCegarLoop]: trace histogram [45, 42, 42, 42, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:36,015 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:36,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1061715719, now seen corresponding path program 4 times [2018-11-12 20:44:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:36,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:36,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-11-12 20:44:36,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:36,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:36,411 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:36,411 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:36,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:36,411 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:44:36,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:36,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:36,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1688 proven. 392 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2018-11-12 20:44:36,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1692 proven. 392 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2018-11-12 20:44:37,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:37,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-12 20:44:37,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:37,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:44:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:44:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:44:37,143 INFO L87 Difference]: Start difference. First operand 549 states and 664 transitions. Second operand 17 states. [2018-11-12 20:44:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:37,305 INFO L93 Difference]: Finished difference Result 1021 states and 1242 transitions. [2018-11-12 20:44:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:44:37,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 210 [2018-11-12 20:44:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:37,310 INFO L225 Difference]: With dead ends: 1021 [2018-11-12 20:44:37,310 INFO L226 Difference]: Without dead ends: 624 [2018-11-12 20:44:37,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:44:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-12 20:44:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 585. [2018-11-12 20:44:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-12 20:44:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 709 transitions. [2018-11-12 20:44:37,347 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 709 transitions. Word has length 210 [2018-11-12 20:44:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:37,348 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 709 transitions. [2018-11-12 20:44:37,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:44:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 709 transitions. [2018-11-12 20:44:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-12 20:44:37,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:37,350 INFO L375 BasicCegarLoop]: trace histogram [48, 45, 45, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:37,350 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:37,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1595542674, now seen corresponding path program 5 times [2018-11-12 20:44:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:37,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:37,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1932 proven. 450 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2018-11-12 20:44:38,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:38,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:38,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:38,117 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:38,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:38,117 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:44:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:38,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:38,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:38,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:38,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1998 proven. 1 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-11-12 20:44:38,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4259 backedges. 1940 proven. 59 refuted. 0 times theorem prover too weak. 2260 trivial. 0 not checked. [2018-11-12 20:44:38,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:38,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 9] total 30 [2018-11-12 20:44:38,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:38,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:44:38,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:44:38,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:44:38,637 INFO L87 Difference]: Start difference. First operand 585 states and 709 transitions. Second operand 26 states. [2018-11-12 20:44:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:39,933 INFO L93 Difference]: Finished difference Result 1103 states and 1349 transitions. [2018-11-12 20:44:39,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:44:39,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2018-11-12 20:44:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:39,934 INFO L225 Difference]: With dead ends: 1103 [2018-11-12 20:44:39,934 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:44:39,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=600, Invalid=1562, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:44:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:44:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:44:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:44:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:44:39,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 222 [2018-11-12 20:44:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:39,940 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:44:39,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:44:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:44:39,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:44:39,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:44:40,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,486 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 88 [2018-11-12 20:44:40,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:40,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:42,034 WARN L179 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 87 DAG size of output: 18 [2018-11-12 20:44:42,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:42,125 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:42,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:42,125 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-11-12 20:44:42,125 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-11-12 20:44:42,125 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-11-12 20:44:42,125 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~last~0 199999) [2018-11-12 20:44:42,126 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|) (and (= main_~b~0 0) (= main_~c~0 0) (<= 0 (+ ~last~0 2147483648)) (= main_~a~0 0) (<= ~last~0 2147483647))) [2018-11-12 20:44:42,126 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (< 199999 |old(~last~0)|)) [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (< 199999 |old(~last~0)|) (<= ~last~0 199999)) [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-11-12 20:44:42,126 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse0 (= main_~b~0 main_~a~0)) (.cse1 (<= main_~c~0 200000))) (or (and .cse0 .cse1 (<= 1 main_~st~0)) (< 199999 |old(~last~0)|) (and .cse0 .cse1 (<= ~last~0 199999)))) [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-11-12 20:44:42,127 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-12 20:44:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:44:42 BoogieIcfgContainer [2018-11-12 20:44:42,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:44:42,142 INFO L168 Benchmark]: Toolchain (without parser) took 30873.95 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 861.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:42,143 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:42,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:42,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:42,145 INFO L168 Benchmark]: Boogie Preprocessor took 30.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:42,145 INFO L168 Benchmark]: RCFGBuilder took 515.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:42,146 INFO L168 Benchmark]: TraceAbstraction took 30018.53 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.4 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -254.3 MB). Peak memory consumption was 901.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:42,150 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 515.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30018.53 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 375.4 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -254.3 MB). Peak memory consumption was 901.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((b == a && c <= 200000) && 1 <= st) || 199999 < \old(last)) || ((b == a && c <= 200000) && last <= 199999) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((b == a && 200000 <= c) && c <= 200000) || 199999 < \old(last)) || ((((b == 0 && c == 0) && 0 <= last + 2147483648) && a == 0) && last <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 29.9s OverallTime, 23 OverallIterations, 48 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 639 SDtfs, 1134 SDslu, 3722 SDs, 0 SdLazy, 3364 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3685 GetRequests, 3198 SyntacticMatches, 9 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.8043478260869565 AbsIntWeakeningRatio, 0.6086956521739131 AbsIntAvgWeakeningVarsNumRemoved, 0.782608695652174 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 692 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 93 PreInvPairs, 264 NumberOfFragments, 88 HoareAnnotationTreeSize, 93 FomulaSimplifications, 59709 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 424 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 3461 NumberOfCodeBlocks, 2973 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5071 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400661 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2250 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 59 InterpolantComputations, 8 PerfectInterpolantSequences, 42768/50566 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...